% $Id: all.bib,v 1.6 2012/12/17 14:50:57 cvs Exp $
% $Log: all.bib,v $
% Revision 1.6  2012/12/17 14:50:57  cvs
% *** empty log message ***
%
% Revision 1.5  2012/12/17 14:23:06  cvs
% *** empty log message ***
%
% Revision 1.4  2012/12/17 04:52:43  cvs
% my bio and bib
%
% Revision 1.3  2012/12/15 22:59:22  cvs
% bib
%
% Revision 1.2  2012/12/15 08:13:43  cvs
% draft0.1
% 
% 
@string{jsac="IEEE Journal of Selected Areas in Communications"} 
@string{ton="IEEE/ACM Transactions on Networking"} 
@string{toc="IEEE Transactions on Communications"} 
@string{cacm="Communications of the {ACM}"} 
@string{tocs="ACM Transactions on Computer Systems"} 
@string{inm="IEEE Network Magazine"} 
@string{itm="IEEE Transactions on Multimedia"} 
@string{ccr="ACM Computer Communication Review"} 
@string{tose="ACM Transactions on Software Engineering"} 
@string{toit="ACM Transactions on Information Theory"} 
@string{lncs="Lecture Notes in Computer Science"} 
 
@string{utcs="Department of Computer Sciences, The University of Texas"} 
 
@string{crypto84="Advances in cryptology, CRYPTO '84"} 
@string{crypto89="Advances in cryptology, CRYPTO '89"} 
@string{crypto92="Advances in cryptology, CRYPTO '92"} 
@string{crypto93="Advances in cryptology, CRYPTO '93"} 
@string{crypto94="Advances in cryptology, CRYPTO '94"} 
@string{crypto95="Advances in cryptology, CRYPTO '95"} 
@string{crypto96="Advances in cryptology, CRYPTO '96"} 
@string{crypto97="Advances in cryptology, CRYPTO '97"} 
@string{crypto98="Advances in cryptology, CRYPTO '98"} 
@string{crypto99="Advances in cryptology, CRYPTO '99"} 
@string{crypto00="Advances in cryptology, CRYPTO '00"} 
@string{crypto01="Advances in cryptology, CRYPTO '01"} 
@string{eurocrypt91="Advances in cryptology, EUROCRYPT '91"} 
@string{eurocrypt92="Advances in cryptology, EUROCRYPT '92"} 
@string{eurocrypt93="Advances in cryptology, EUROCRYPT '93"} 
@string{eurocrypt94="Advances in cryptology, EUROCRYPT '94"} 
@string{eurocrypt95="Advances in cryptology, EUROCRYPT '95"} 
@string{eurocrypt96="Advances in cryptology, EUROCRYPT '96"} 
@string{eurocrypt97="Advances in cryptology, EUROCRYPT '97"} 
@string{eurocrypt98="Advances in cryptology, EUROCRYPT '98"} 
@string{eurocrypt99="Advances in cryptology, EUROCRYPT '99"} 
@string{eurocrypt00="Advances in cryptology, EUROCRYPT '00"} 
@string{eurocrypt01="Advances in cryptology, EUROCRYPT '01"} 
@string{eurocrypt02="Advances in cryptology, EUROCRYPT '02"} 

@ARTICLE{FBMC, 
author={Farhang-Boroujeny, B.}, 
journal={Signal Processing Magazine, IEEE}, 
title={OFDM Versus Filter Bank Multicarrier}, 
year={2011}, 
month={May}, 
volume={28}, 
number={3}, 
pages={92-112}, 
keywords={OFDM modulation;broadband networks;channel bank filters;OFDM;broadband multicarrier communications;cognitive radios;filter bank multicarrier;multiuser multicarrier systems;orthogonal frequency division multiplexing;subcarriers;uplink;Bandwidth;Cognitive radio;Filter banks;Low pass filters;OFDM;Prototypes;Receivers}, 
doi={10.1109/MSP.2011.940267}, 
ISSN={1053-5888},}

@inproceedings{zhang2012demo,
  title={Demo: runtime {MAC} reconfiguration using a meta-compiler assisted toolchain},
  author={Zhang, Xi and Ansari, Junaid and M{\"a}h{\"o}nen, Petri},
  booktitle={ACM SIGCOMM Demo},
  year={2012}
}

@inproceedings{maclets,
  title={MAClets: active {MAC} protocols over hard-coded devices},
  author={Bianchi, Giuseppe and Gallo, Pierluigi and Garlisi, Domenico and Giuliano, Fabrizio and Gringoli, Francesco and Tinnirello, Ilenia},
  booktitle={ACM CoNEXT},
  year={2012}
}


@inproceedings{zhang2013enabling,
  title={Enabling rapid prototyping of reconfigurable mac protocols for wireless sensor networks},
  author={Zhang, Xi and Ansari, Junaid and Martinez, Luis Miguel Amoros and Linio, Noemi Arbos and Mahonen, P},
  booktitle={IEEE WCNC},
  year={2013}
}


@inproceedings{zhang2011trump,
  title={Trump: Supporting efficient realization of protocols for cognitive radio networks},
  author={Zhang, Xi and Ansari, Junaid and Yang, Guangwei and Mahonen, P},
  booktitle={IEEE DySPAN},
  year={2011}
}

@inproceedings{neel2005formal,
  title={A formal methodology for estimating the feasible processor solution space for a software radio},
  author={Neel, Jody and Robert, P and Reed, J},
  booktitle={SDR},
  year={2005}
}


@article{programming,
  title={Programming protocol-independent packet processors},
  author={Bosshart, Pat and Daly, Dan and Izzard, Martin and McKeown, Nick and Rexford, Jennifer and Talayco, Dan and Vahdat, Amin and Varghese, George and Walker, David},
  journal={SIGCOMM CCR},
  year={2014}
}

@inproceedings{virtual,
  title={Virtual base station pool: towards a wireless network cloud for radio access networks},
  author={Zhu, ZhenBo and Gupta, Parul and Wang, Qing and Kalyanaraman, Shivkumar and Lin, Yonghua and Franke, Hubertus and Sarangi, Smruti},
  booktitle={ACM CF},
  year={2011}
}

@inproceedings{MACProcessor,
 author = {Tinnirello, Ilenia and  Bianchi, Giuseppe and  Gallo, Pierluigi and Garlisi, Domenico and  Giuliano, Francesco and  Gringoli, Francesco},
 title = {Wireless MAC Processors: Programming MAC Protocols on Commodity Hardware}, 
 booktitle = {IEEE INFOCOM},
 year = {2012}
} 

@misc{CRAN,
  author =	 {ChinaMobile},
  title =	 {{C-RAN}: The Road Towards Green {RAN}},
  howpublished = {white paper},
  year = {2011}
}

@inproceedings{Maple13,
 author = {Voellmy, Andreas and Wang, Junchang and Yang, Y Richard and Ford, Bryan and Hudak, Paul},
 title = {Maple: Simplifying SDN Programming Using Algorithmic Policies},
 booktitle = {Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM},
 series = {SIGCOMM '13},
 year = {2013},
 isbn = {978-1-4503-2056-6},
 location = {Hong Kong, China},
 pages = {87--98},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2486001.2486030},
 doi = {10.1145/2486001.2486030},
 acmid = {2486030},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {algorithmic policies, openflow, software-defined networking},
} 

@inproceedings{Frenetic11,
 author = {Foster, Nate and Harrison, Rob and Freedman, Michael J. and Monsanto, Christopher and Rexford, Jennifer and Story, Alec and Walker, David},
 title = {Frenetic: A Network Programming Language},
 booktitle = {Proceedings of the 16th ACM SIGPLAN International Conference on Functional Programming},
 series = {ICFP '11},
 year = {2011},
 isbn = {978-1-4503-0865-6},
 location = {Tokyo, Japan},
 pages = {279--291},
 numpages = {13},
 url = {http://doi.acm.org/10.1145/2034773.2034812},
 doi = {10.1145/2034773.2034812},
 acmid = {2034812},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {domain-specific languages, functional reactive programming, network programming languages, openflow},
} 

@InProceedings{Blink13, 
  author =	  {Gordon Stewart and Mahanth Gowda and Geoffrey Mainland and Bozidar Radunovic and Dimitrios Vytiniotis}, 
  title =	  {Blink: Wireless Programming for Hardware Dummies}, 
  booktitle =	  {Microsoft Research Technical Report MSR-TR-2013-135}, 
  year =	  2013
} 

@INPROCEEDINGS{StateMachineMAc03, 
author={Xiao, Z. and Randhawa, T.S. and Hardy, R. H S}, 
booktitle={Vehicular Technology Conference, 2003. VTC 2003-Spring. The 57th IEEE Semiannual}, 
title={A state-machine based design of adaptive wireless MAC layer}, 
year={2003}, 
month={April}, 
volume={4}, 
pages={2837-2841 vol.4}, 
keywords={carrier sense multiple access;mobile radio;packet radio networks;software radio;802.11 MAC protocol;GPRS RLC;General Packet Radio Service;SDR mobile station;adaptive wireless MAC layer;medium access control;p-persistent CSMA;slotted Aloha protocol;software defined radio;state-machine based design;wireless protocols;3G mobile communication;Environmental economics;GSM;Ground penetrating radar;Media Access Protocol;Physical layer;Software radio;Telephone sets;Wireless application protocol;Wireless networks}, 
doi={10.1109/VETECS.2003.1208911}, 
ISSN={1090-3038},}

@ARTICLE{P4-2013,
   author = {{Bosshart}, P. and {Daly}, D. and {Izzard}, M. and {McKeown}, N. and 
	{Rexford}, J. and {Schlesinger}, C. and {Talayco}, D. and {Vahdat}, A. and 
	{Varghese}, G. and {Walker}, D.},
    title = "{Programming Protocol-Independent Packet Processors}",
  journal = {ArXiv e-prints},
archivePrefix = "arXiv",
   eprint = {1312.1719},
 primaryClass = "cs.NI",
 keywords = {Computer Science - Networking and Internet Architecture},
     year = 2013,
    month = dec,
   adsurl = {http://adsabs.harvard.edu/abs/2013arXiv1312.1719B},
  adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@inproceedings {nlog14,
author = {Teemu Koponen and Keith Amidon and Peter Balland and Martin Casado and Anupam Chanda and Bryan Fulton and Igor Ganichev and Jesse Gross and Paul Ingram and Ethan Jackson and Andrew Lambeth and Romain Lenglet and Shih-Hao Li and Amar Padmanabhan and Justin Pettit and Ben Pfaff and Rajiv Ramanathan and Scott Shenker and Alan Shieh and Jeremy Stribling and Pankaj Thakkar and Dan Wendlandt and Alexander Yip and Ronghua Zhang},
title = {Network Virtualization in Multi-tenant Datacenters},
booktitle = {11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14)},
year = {2014},
month = Apr,
isbn = {978-1-931971-09-6},
address = {Seattle, WA},
pages = {203--216},
url = {https://www.usenix.org/conference/nsdi14/technical-sessions/presentation/koponen},
publisher = {USENIX Association},
}

@inproceedings {RadioVisor14,
author = {Sachin Katti and Li Erran Li},
title = {RadioVisor: A Slicing Plane for Radio Access Networks},
booktitle = {ONS},
year = {2014},
url = {https://www.usenix.org/conference/ons2014/technical-sessions/presentation/katti},
}


@inproceedings{CloudIQ12,
 author = {Bhaumik, Sourjya and Chandrabose, Shoban Preeth and Jataprolu, Manjunath Kashyap and Kumar, Gautam and Muralidhar, Anand and Polakos, Paul and Srinivasan, Vikram and Woo, Thomas},
 title = {{CloudIQ}: A Framework for Processing Base Stations in a Data Center},
 booktitle = {Proceedings of the 18th Annual International Conference on Mobile Computing and Networking},
 series = {Mobicom '12},
 year = {2012},
 isbn = {978-1-4503-1159-5},
 location = {Istanbul, Turkey},
 pages = {125--136},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2348543.2348561},
 doi = {10.1145/2348543.2348561},
 acmid = {2348561},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {cellular, cloud-ran, virtualization},
} 

@inproceedings{BigStation13,
 author = {Yang, Qing and Li, Xiaoxiao and Yao, Hongyi and Fang, Ji and Tan, Kun and Hu, Wenjun and Zhang, Jiansong and Zhang, Yongguang},
 title = {BigStation: Enabling Scalable Real-time Signal Processingin Large Mu-mimo Systems},
 booktitle = {ACM SIGCOMM},
 year = {2013},
 isbn = {978-1-4503-2056-6},
 keywords = {bigstation, mu-mimo, parallel signal processing, software radio}
} 

@article{SoraACM11,
 author = {Tan, Kun and Zhang, Jiansong and Fang, Ji and Liu, He and Ye, Yusheng and Wang, Shen and Zhang, Yongguang and Wu, Haitao and Wang, Wei and Voelker, Geoffrey M.},
  title = {Sora: High Performance Software Radio Using General Purpose Multi-core Processors},
  booktitle = {ACM NSDI},
  year = {2009}
}


% series = {SIGCOMM '12},
% location = {Helsinki, Finland},
% pages = {37--48},
% numpages = {12},
% publisher = {ACM},
% address = {New York, NY, USA},
@INPROCEEDINGS{maxmin-infocom2012, 
author={Danna, E. and Mandal, S. and Singh, A.}, 
booktitle={INFOCOM, 2012 Proceedings IEEE}, 
title={A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering}, 
year={2012}, 
month={March}, 
pages={846-854}, 
keywords={bandwidth allocation;linear programming;minimax techniques;telecommunication network routing;telecommunication traffic;bandwidth allocation;fairness degradation;fairness objectives;importance weights;linear programming;max-min fairness;piecewise linear utility functions;throughput degradation;throughput objectives;traffic engineering;Approximation algorithms;Bandwidth;Degradation;Linear programming;Resource management;Throughput;Upper bound}, 
doi={10.1109/INFCOM.2012.6195833}, 
ISSN={0743-166X},}

@ARTICLE{ICICsurvey2013, 
author={Hamza, A.S. and Khalifa, S.S. and Hamza, H.S. and Elsayed, K.}, 
journal={Communications Surveys Tutorials, IEEE}, 
title={A Survey on Inter-Cell Interference Coordination Techniques in {OFDMA}-Based Cellular Networks}, 
year={2013}, 
month={Fourth}, 
volume={15}, 
number={4}, 
pages={1642-1670}, 
keywords={OFDM modulation;cellular radio;radiofrequency interference;ICIC;OFDMA based cellular networks;intercell interference coordination techniques;orthogonal frequency division multiplexing access;parameterized classifications;Base stations;Downlink;Interference;OFDM;Radio spectrum management;Resource management;Signal to noise ratio;Frequency Reuse;Inter-cell Interference coordination (ICIC);Long Term Evolution (LTE);OFDMA}, 
doi={10.1109/SURV.2013.013013.00028}, 
ISSN={1553-877X},}

@inproceedings{CellSlice13, 
author={Kokku, R. and Mahindra, R. and Honghai Zhang and Rangarajan, S.}, 
booktitle={Communication Systems and Networks (COMSNETS), 2013 Fifth International Conference on}, 
title={CellSlice: Cellular wireless resource slicing for active RAN sharing}, 
year={2013}, 
month={Jan}, 
pages={1-10}, 
keywords={Long Term Evolution;WiMax;access protocols;cellular radio;radio access networks;scheduling;CellSlice;LTE-advanced;WiMAX networks;access-technology;active RAN sharing;basestations MAC schedulers;cellular network;cellular wireless resource slicing;gateway-level solution;native basestation virtualization solution;picochip WiMAX testbed;radio access network;remote downlink;remote uplink;resource scheduling;simple feedback-based adaptation;uplink direction;uplink scheduler decisions;Downlink;Logic gates;Radio access networks;Resource management;Uplink;WiMAX}, 
doi={10.1109/COMSNETS.2013.6465548},}

@inproceedings{NetShare13, 
author={Mahindra, R. and Khojastepour, M.A. and Honghai Zhang and Rangarajan, S.}, 
booktitle={Network Protocols (ICNP), 2013 21st IEEE International Conference on}, 
title={Radio Access Network sharing in cellular networks}, 
year={2013}, 
month={Oct}, 
pages={1-10}, 
keywords={Long Term Evolution;WiMax;cellular radio;radio access networks;radio spectrum management;resource allocation;smart phones;telecommunication traffic;LTE-based system;NetShare;RAN;WiMAX testbed;cellular basestations;cellular networks;diverse services;innovative applications;mobile gateway;mobile operators;mobile traffic transitions;network-wide radio resource management;radio access network sharing;resource allocation;resource demand;smartphones;traffic growth;two-level scheduler split;wireless resources;Aggregates;Logic gates;Mobile communication;Radio access networks;Resource management;WiMAX}, 
doi={10.1109/ICNP.2013.6733595},}

@inproceedings{Picasso12,
 author = {Hong, Steven S. and Mehlman, Jeffrey and Katti, Sachin},
 title = {Picasso: Flexible {RF} and Spectrum Slicing},
 booktitle = {{ACM SIGCOMM}},
 year = {2012},
 isbn = {978-1-4503-1419-0},
 url = {http://doi.acm.org/10.1145/2342356.2342362},
 doi = {10.1145/2342356.2342362},
 acmid = {2342362},
 keywords = {interference cancellation, radio virtualization},
} 


% booktitle = {Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking},
% series = {HotSDN '13},
% pages = {25--30},
% numpages = {6},
% publisher = {ACM},
% address = {New York, NY, USA},
@inproceedings{SoftRAN13,
 author = {Gudipati, Aditya and Perry, Daniel and Li, Li Erran and Katti, Sachin},
 title = {{SoftRAN}: Software Defined Radio Access Network},
 booktitle = {ACM HotSDN},
 year = {2013},
 isbn = {978-1-4503-2178-5},
 location = {Hong Kong, China},
 url = {http://doi.acm.org/10.1145/2491185.2491207},
 doi = {10.1145/2491185.2491207},
 acmid = {2491207},
 keywords = {radio access networks, software defined networking},
} 

@inproceedings{SplitMerge13,
 author = {Rajagopalan, Shriram and Williams, Dan and Jamjoom, Hani and Warfield, Andrew},
 title = {Split/Merge: System Support for Elastic Execution in Virtual Middleboxes},
 booktitle = {Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation},
 series = {nsdi'13},
 year = {2013},
 location = {Lombard, IL},
 pages = {227--240},
 numpages = {14},
 url = {http://dl.acm.org/citation.cfm?id=2482626.2482649},
 acmid = {2482649},
 publisher = {USENIX Association},
 address = {Berkeley, CA, USA},
} 

@inproceedings{HotSwap13,
 author = {Vanbever, Laurent and Reich, Joshua and Benson, Theophilus and Foster, Nate and Rexford, Jennifer},
 title = {HotSwap: Correct and Efficient Controller Upgrades for Software-defined Networks},
 booktitle = {Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking},
 series = {HotSDN '13},
 year = {2013},
 isbn = {978-1-4503-2178-5},
 location = {Hong Kong, China},
 pages = {133--138},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/2491185.2491194},
 doi = {10.1145/2491185.2491194},
 acmid = {2491194},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {controller upgrade, dynamic software updating, software-defined network},
} 

@inproceedings{M2Msigm12,
 author = {Shafiq, Muhammad Zubair and Ji, Lusheng and Liu, Alex X. and Pang, Jeffrey and Wang, Jia},
 title = {A First Look at Cellular Machine-to-machine Traffic: Large Scale Measurement and Characterization},
 booktitle = {SIGMETRICS},
 year = {2012},
 doi = {10.1145/2254756.2254767},
 acmid = {2254767},
 keywords = {cellular network, machine-to-machine traffic},
} 

@inproceedings{coexistence,
 author = {Cidon, Asaf and Nagaraj, Kanthi and Katti, Sachin and Viswanath, Pramod},
 title = {Flashback: Decoupled Lightweight Wireless Control},
 booktitle = {Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication},
 series = {SIGCOMM '12},
 year = {2012},
 isbn = {978-1-4503-1419-0},
 location = {Helsinki, Finland},
 pages = {223--234},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2342356.2342400},
 doi = {10.1145/2342356.2342400},
 acmid = {2342400},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {wireless control},
} 

@inproceedings{slicing,
 author = {Hong, Steven S. and Mehlman, Jeffrey and Katti, Sachin},
 title = {Picasso: Flexible RF and Spectrum Slicing},
 booktitle = {Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication},
 series = {SIGCOMM '12},
 year = {2012},
 isbn = {978-1-4503-1419-0},
 location = {Helsinki, Finland},
 pages = {37--48},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2342356.2342362},
 doi = {10.1145/2342356.2342362},
 acmid = {2342362},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {interference cancellation, radio virtualization},
} 

@inproceedings{mobicom-duplex,
 author = {Jain, Mayank and Choi, Jung Il and Kim, Taemin and Bharadia, Dinesh and Seth, Siddharth and Srinivasan, Kannan and Levis, Philip and Katti, Sachin and Sinha, Prasun},
 title = {Practical, Real-time, Full Duplex Wireless},
 booktitle = {Proceedings of the 17th Annual International Conference on Mobile Computing and Networking},
 series = {MobiCom '11},
 year = {2011},
 isbn = {978-1-4503-0492-4},
 location = {Las Vegas, Nevada, USA},
 pages = {301--312},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2030613.2030647},
 doi = {10.1145/2030613.2030647},
 acmid = {2030647},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {full-duplex wireless},
} 

@inproceedings{SoftCell2013,
 author = {Jin, Xin and Li, Li Erran and Vanbever, Laurent and Rexford, Jennifer},
 title = {SoftCell: Scalable and Flexible Cellular Core Network Architecture},
 booktitle = {Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies},
 series = {CoNEXT '13},
 year = {2013},
 isbn = {978-1-4503-2101-3},
 location = {Santa Barbara, California, USA},
 pages = {163--174},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2535372.2535377},
 doi = {10.1145/2535372.2535377},
 acmid = {2535377},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {architecture design, cellular core networks, software-defined networking},
} 

@inproceedings{Corybantic2013,
 author = {Mogul, Jeffrey C. and AuYoung, Alvin and Banerjee, Sujata and Popa, Lucian and Lee, Jeongkeun and Mudigonda, Jayaram and Sharma, Puneet and Turner, Yoshio},
 title = {Corybantic: Towards the Modular Composition of SDN Control Programs},
 booktitle = {Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks},
 series = {HotNets-XII},
 year = {2013},
 isbn = {978-1-4503-2596-7},
 location = {College Park, Maryland},
 pages = {1:1--1:7},
 articleno = {1},
 numpages = {7},
 url = {http://doi.acm.org/10.1145/2535771.2535795},
 doi = {10.1145/2535771.2535795},
 acmid = {2535795},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {software-defined networking},
} 

@inproceedings{compositionNSDI2013,
 author = {Monsanto, Christopher and Reich, Joshua and Foster, Nate and Rexford, Jennifer and Walker, David},
 title = {Composing Software-defined Networks},
 booktitle = {Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation},
 series = {nsdi'13},
 year = {2013},
 location = {Lombard, IL},
 pages = {1--14},
 numpages = {14},
 url = {http://dl.acm.org/citation.cfm?id=2482626.2482629},
 acmid = {2482629},
 publisher = {USENIX Association},
 address = {Berkeley, CA, USA},
} 


@inproceedings{DRF-NSDI2011,
 author = {Ghodsi, Ali and Zaharia, Matei and Hindman, Benjamin and Konwinski, Andy and Shenker, Scott and Stoica, Ion},
 title = {Dominant Resource Fairness: Fair Allocation of Multiple Resource Types},
 booktitle = {Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation},
 series = {NSDI'11},
 year = {2011},
 location = {Boston, MA},
 pages = {24--24},
 numpages = {1},
 url = {http://dl.acm.org/citation.cfm?id=1972457.1972490},
 acmid = {1972490},
 publisher = {USENIX Association},
 address = {Berkeley, CA, USA},
} 

% series = {ACM HotSDN},
%Proceedings of the First Workshop on Hot Topics in Software Defined Networks},
%location = {Helsinki, Finland},
% pages = {109--114},
% numpages = {6},
% url = {http://doi.acm.org/10.1145/2342441.2342464},
% doi = {10.1145/2342441.2342464},
% acmid = {2342464},
% publisher = {ACM},
% address = {New York, NY, USA},

@inproceedings{OpenRadio,
 author = {Bansal, Manu and Mehlman, Jeffrey and Katti, Sachin and Levis, Philip},
 title = {{OpenRadio}: A Programmable Wireless Dataplane},
 booktitle = {{ACM HotSDN}},
 year = {2012},
 isbn = {978-1-4503-1477-0},
 keywords = {dataplane, infrastructure, programmable, wireless}
} 

@ARTICLE{NVS12, 
author={Kokku, R. and Mahindra, R. and Honghai Zhang and Rangarajan, S.}, 
journal={Networking, IEEE/ACM Transactions on}, 
title={NVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks}, 
year={2012}, 
volume={20}, 
number={5}, 
pages={1333-1346}, 
keywords={WiMax;cellular radio;scheduling;NVS;WiMax testbed;bandwidth-based reservation;base station downlink resource;base station uplink resource;cellular networks;customization;customized flow scheduling;customized virtual networks;diverse performance objective;efficient resource utilization;isolation;network virtualization substrate;optimal slice scheduler;resource-based reservation;slice-specific application optimization;virtual services;wide-area corporate networks;wireless resource virtualization;Bandwidth;Base stations;Downlink;Quality of service;Resource management;WiMAX;Cellular networks;flow scheduling;network slicing;programmability;spectrum sharing;virtualization;wireless resource management}, 
doi={10.1109/TNET.2011.2179063}, 
ISSN={1063-6692},}

@misc{NetShare3Gpp,
  author =	 {3GPP TS 23.251},
  title =	 {Network Sharing; Architecture and functional description},
  howpublished = {\url{http://www.3gpp.org/DynaReport/23251.htm}}
}

@misc{NetShareReport10,
  author =	 {Visiongain},
  title =	 {Mobile Network Sharing Report 2010-2015, Development, Analysis \& Forecasts},
  howpublished = {Market Study, 2010.}
}

@inproceedings{Ethane2007,
 author = {Casado, Martin and Freedman, Michael J. and Pettit, Justin and Luo, Jianying and McKeown, Nick and Shenker, Scott},
 title = {Ethane: taking control of the enterprise},
 series = {SIGCOMM '07},
 year = {2007},
 isbn = {978-1-59593-713-1},
 location = {Kyoto, Japan},
 pages = {1--12},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/1282380.1282382},
 doi = {10.1145/1282380.1282382},
 acmid = {1282382},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {architecture, management, network, security},
} 


@misc{SON_LTE_Spec,
  author =	 {3gpp},
  title =	 {Self-Organizing Networks ({SON}) Policy Network Resource Model ({NRM}) Integration Reference Point ({IRP})},
  howpublished = {\url{http://www.3gpp.org/ftp/Specs/archive/32\_series/32.521/}}
}

@misc{SpectrumAvailable,
  author = {Jin, Xin and Li, Li Erran and Vanbever, Laurent and Rexford, Jennifer},
  title = {Princeton University Technical Report},
  howpublished = {\url{http://www.cs.princeton.edu/research/techreps/TR-950-13}}
}

@misc{Femto_API,
  author =  {Small Cell Forum},
  title = {Femto Application Platform Interface},
  howpublished = {\url{http://www.smallcellforum.org/resources-technical-papers}}
} 

%  organization={USENIX}
@inproceedings{FlowVisor:2010,
  title={Can the production network be the testbed?},
  author={Sherwood, R. and Gibb, G. and Yap, K.K. and Appenzeller, G. and Casado, M. and McKeown, N. and Parulkar, G.},
  booktitle={{USENIX OSDI}},
  year={2010}
}

@INPROCEEDINGS{cloudEPC12, 
author={Kempf, J. and Johansson, B. and Pettersson, S. and Luning, H. and Nilsson, T.}, 
title={Moving the mobile evolved packet core to the cloud}, 
booktitle={IEEE WiMob}, 
month= oct, 
year = 2012,
}


@misc{LTE-sim,
  author =	 {},
  title =	 {LTE Simulator},
  howpublished = {\url{http://telematics.poliba.it/index.php/en/lte-sim}}
}

%@misc{ATTDenseDeployment, author = {Bounds, J.}, title = {Small cells to play a big role in AT\&T build out},howpublished={\url{http://www.bizjournals.com/dallas/blog/2012/11/small-cells-to-play-big-role-in-att.html}}}

@INPROCEEDINGS{CellSDNEuroSDN12, 
author={Li, L.E. and Mao, Z.M. and Rexford, J.},
title={Toward Software-Defined Cellular Networks},
booktitle={European Workshop on Software Defined Networking (EWSDN)},  
month = oct,
year= 2012
}


@inproceedings{OpenRoads,
 author = {Yap, Kok-Kiong and Sherwood, Rob and Kobayashi, Masayoshi
                  and Huang, Te-Yuan and Chan, Michael and Handigol,
                  Nikhil and McKeown, Nick and Parulkar, Guru},
 title = {Blueprint for introducing innovation into wireless mobile
                  networks},
 booktitle = {VISA '10: Proceedings of the second ACM SIGCOMM workshop
                  on Virtualized infrastructure systems and
                  architectures},
 year = {2010},
 isbn = {978-1-4503-0199-2},
 pages = {25--32},
 location = {New Delhi, India},
 doi = {http://doi.acm.org/10.1145/1851399.1851404},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inproceedings{CloudIQ,
 author = {Bhaumik, Sourjya and Chandrabose, Shoban Preeth and Jataprolu, Manjunath Kashyap and Kumar, Gautam and Muralidhar, Anand and Polakos, Paul and Srinivasan, Vikram and Woo, Thomas},
 title = {{CloudIQ}: a framework for processing base stations in a data center},
 series = {ACM Mobicom},
 year = {2012},
 isbn = {978-1-4503-1159-5},
 location = {Istanbul, Turkey},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2348543.2348561},
 doi = {10.1145/2348543.2348561},
 acmid = {2348561},
 keywords = {cellular, cloud-ran, virtualization},
} 


@inproceedings{distColor06,
 author = {Kuhn, Fabian and Wattenhofer, Rogert},
 title = {On the complexity of distributed graph coloring},
 booktitle = {PODC},
 year = {2006},
 isbn = {1-59593-384-0},
 location = {Denver, Colorado, USA},
 pages = {7--15},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/1146381.1146387},
 doi = {10.1145/1146381.1146387},
 acmid = {1146387},
 keywords = {chromatic number, distributed algorithms, graph coloring, locality, neighborhood graph, symmetry breaking},
} 


@book{LTEbook,
  title={{LTE} - the {UMTS} Long Term Evolution: From Theory to Practice},
  author={Sesia, S. and Baker, M. and Toufik, I.},
  isbn={9780470660256},
  lccn={2010039466},
  url={http://books.google.com/books?id=g0lficnQ6eUC},
  year={2011},
  publisher={John Wiley \& Sons}
}


@inproceedings{MaoLTE13,
 author = {Huang, Junxian and Qian, Feng and Guo, Yihua and Zhou, Yuanyuan and Xu, Qiang and Mao, Z. Morley and Sen, Subhabrata and Spatscheck, Oliver},
 title = {An In-depth Study of LTE: Effect of Network Protocol and Application Behavior on Performance},
 booktitle = {Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM},
 series = {SIGCOMM '13},
 year = {2013},
 isbn = {978-1-4503-2056-6},
 location = {Hong Kong, China},
 pages = {363--374},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2486001.2486006},
 doi = {10.1145/2486001.2486006},
 acmid = {2486006},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {4g, bandwidth estimation, lte, resource underutilization, tcp performance},
} 

@inproceedings{CellWiFiIMC12,
 author = {Sommers, Joel and Barford, Paul},
 title = {Cell vs. WiFi: On the Performance of Metro Area Mobile Connections},
 booktitle = {Proceedings of the 2012 ACM Conference on Internet Measurement Conference},
 series = {IMC '12},
 year = {2012},
 isbn = {978-1-4503-1705-4},
 location = {Boston, Massachusetts, USA},
 pages = {301--314},
 numpages = {14},
 url = {http://doi.acm.org/10.1145/2398776.2398808},
 doi = {10.1145/2398776.2398808},
 acmid = {2398808},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {WiFi, cellular},
} 

@inproceedings{MaoLTE12,
 author = {Huang, Junxian and Qian, Feng and Gerber, Alexandre and Mao, Z. Morley and Sen, Subhabrata and Spatscheck, Oliver},
 title = {A Close Examination of Performance and Power Characteristics of 4G LTE Networks},
 booktitle = {Proceedings of the 10th International Conference on Mobile Systems, Applications, and Services},
 series = {MobiSys '12},
 year = {2012},
 isbn = {978-1-4503-1301-8},
 location = {Low Wood Bay, Lake District, UK},
 pages = {225--238},
 numpages = {14},
 url = {http://doi.acm.org/10.1145/2307636.2307658},
 doi = {10.1145/2307636.2307658},
 acmid = {2307658},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {3g, 4g, 4gtest, energy saving, lte, network model simulation, power model simulation},
} 

@Misc{OpenBTS, 
  author =	 {{Range Networks}}, 
  title =	 {Open Base Transceiver Station ({OpenBTS})},
  howpublished = {\url{http://openbts.org/}}, 
  annote =	 {} 
} 


@Misc{OSLD, 
  author =	 {{FlexNets Group}}, 
  title =	 {Open-Source Long-Term Evolution ({LTE}) Deployment ({OSLD})},
  howpublished = {\url{https://sites.google.com/site/osldproject/}}, 
  annote =	 {} 
} 

@Misc{soft-LTE, 
  author =	 {{Yuxiang Li, et. al.}}, 
  title =	 {Soft-LTE: A Software Radio Implementation of 3GPP Long Term Evolution Based on Sora Platform},
  howpublished = {\url{http://research.microsoft.com/en-us/projects/sora/tan-demo-sdr-lte.pdf}}, 
  annote =	 {Demo in ACM MobiCom, 2009} 
}

@Misc{lte-loc, 
  author =	 {Alcatel-Lucent}, 
  title =	 {A Primer on Location Technologies in LTE Networks}, 
  howpublished = {\url{http://www2.alcatel-lucent.com/techzine/a-primer-on-location-technologies-in-lte-networks/}}, 
  annote =	 {July 16, 2012} 
} 

@Misc{MDT, 
  author =	 {3gpp}, 
  title =	 {Radio measurement collection for Minimization of Drive Tests (MDT)}, 
  howpublished = {\url{http://www.etsi.org/deliver/etsi\_ts/137300\_137399/137320/11.03.00\_60/ts\_137320v110300p.pdf}}, 
  annote =	 {} 
}

@Misc{Wavejudge, 
  author =	 {Sanjole}, 
  title =	 {The WaveJudge Wireless Test System}, 
  howpublished = {\url{http://www.sanjole.com/our-products/wavejudge-test-system/}}, 
  annote =	 {} 
}

@inproceedings{ArrayTrack13,
 author = {Xiong, Jie and Jamieson, Kyle},
 title = {ArrayTrack: A Fine-grained Indoor Location System},
 booktitle = {Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation},
 series = {nsdi'13},
 year = {2013},
 location = {Lombard, IL},
 pages = {71--84},
 numpages = {14},
 url = {http://dl.acm.org/citation.cfm?id=2482626.2482635},
 acmid = {2482635},
 publisher = {USENIX Association},
 address = {Berkeley, CA, USA},
} 

@inproceedings{sdnMB12,
 author = {Gember, Aaron and Prabhu, Prathmesh and Ghadiyali, Zainab and Akella, Aditya},
 title = {Toward software-defined middlebox networking},
 booktitle = {Proceedings of the 11th ACM Workshop on Hot Topics in Networks},
 series = {HotNets-XI},
 year = {2012},
 isbn = {978-1-4503-1776-4},
 location = {Redmond, Washington},
 pages = {7--12},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/2390231.2390233},
 doi = {10.1145/2390231.2390233},
 acmid = {2390233},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@inproceedings{manefesto11,
 author = {Sekar, Vyas and Ratnasamy, Sylvia and Reiter, Michael K. and Egi, Norbert and Shi, Guangyu},
 title = {The middlebox manifesto: enabling innovation in middlebox deployment},
 booktitle = {Proceedings of the 10th ACM Workshop on Hot Topics in Networks},
 series = {HotNets-X},
 year = {2011},
 isbn = {978-1-4503-1059-8},
 location = {Cambridge, Massachusetts},
 pages = {21:1--21:6},
 articleno = {21},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/2070562.2070583},
 doi = {10.1145/2070562.2070583},
 acmid = {2070583},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {consolidation, middlebox, network management},
} 

@inproceedings{consMBNSDI12,
 author = {Sekar, Vyas and Egi, Norbert and Ratnasamy, Sylvia and Reiter, Michael K. and Shi, Guangyu},
 title = {Design and implementation of a consolidated middlebox architecture},
 booktitle = {Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation},
 series = {NSDI'12},
 year = {2012},
 location = {San Jose, CA},
 pages = {24--24},
 numpages = {1},
 url = {http://dl.acm.org/citation.cfm?id=2228298.2228331},
 acmid = {2228331},
 publisher = {USENIX Association},
 address = {Berkeley, CA, USA},
} 

@inproceedings{AlgoIAC,
 author = {Li, Li Erran and Alimi, Richard and Shen, Dawei and Viswanathan, Harish and Yang, Y. Richard},
 title = {A general algorithm for interference alignment and cancellation in wireless networks},
 booktitle = {Proceedings of the 29th conference on Information communications},
 series = {INFOCOM'10},
 year = {2010},
 isbn = {978-1-4244-5836-3},
 location = {San Diego, California, USA},
 pages = {1774--1782},
 numpages = {9},
 url = {http://dl.acm.org/citation.cfm?id=1833515.1833759},
 acmid = {1833759},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
} 

@inproceedings{Argos,
 author = {Shepard, Clayton and Yu, Hang and Anand, Narendra and Li, Erran and Marzetta, Thomas and Yang, Richard and Zhong, Lin},
 title = {Argos: practical many-antenna base stations},
 booktitle = {Proceedings of the 18th annual international conference on Mobile computing and networking},
 series = {Mobicom '12},
 year = {2012},
 isbn = {978-1-4503-1159-5},
 location = {Istanbul, Turkey},
 pages = {53--64},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2348543.2348553},
 doi = {10.1145/2348543.2348553},
 acmid = {2348553},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {MRT, beamforming, conjugate, large-scale antenna systems (LSAS), many-antenna, massive MIMO, multi-user MIMO, zero-forcing},
} 
@inproceedings{Remap,
 author = {Li, Li Erran and Tan, Kun and Viswanathan, Harish and Xu, Ying and Yang, Yang Richard},
 title = {Retransmission \&\#8800; repeat: simple retransmission permutation can resolve overlapping channel collisions},
 booktitle = {Proceedings of the sixteenth annual international conference on Mobile computing and networking},
 series = {MobiCom '10},
 year = {2010},
 isbn = {978-1-4503-0181-7},
 location = {Chicago, Illinois, USA},
 pages = {281--292},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/1859995.1860028},
 doi = {10.1145/1859995.1860028},
 acmid = {1860028},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {collision decoding, interference cancellation, loss of orthogonality, ofdm, time-frequency decoding},
} 

@inproceedings{QuickSense13,
 author = {Yoon, Sungro and Li Erran, Li and Liew, Soung and Roy Choudhury, Romit and Tan, Kun and Rhee, Injong},
 title = {QuickSense: Fast and Energy-Efficient Channel Sensing for Dynamic Spectrum Access Wireless Networks},
 booktitle = {Proceedings of the 32th conference on Information communications},
 series = {INFOCOM'13},
 year = {2013},
} 

@inproceedings{mosaic-ladis10, 
  author =	 {L. Erran Li and Michael F. Nowlan and Y. Richard 
                  Yang and Ming Zhang}, 
  title =	 {Mosaic: Policy Homomorphic Network Extension}, 
  booktitle =	 {Proceedings of the ACM Large-Scale Distributed 
                  Systems and Middleware (LADIS)}, 
  series =	 {LADIS '10}, 
  year =	 {2010} 
}  
 
@Misc{googleCD, 
  author =	 {Google}, 
  title =	 {Google Cluster Data}, 
  howpublished = {\url{http://code.google.com/p/googleclusterdata/}}, 
  annote =	 {} 
} 
 
@inproceedings{fattree08, 
  author =	 {Al-Fares, Mohammad and Loukissas, Alexander and 
                  Vahdat, Amin}, 
  title =	 {A scalable, commodity data center network 
                  architecture}, 
  booktitle =	 {Proceedings of the ACM SIGCOMM 2008 conference on 
                  Data communication}, 
  series =	 {SIGCOMM '08}, 
  year =	 {2008}, 
  isbn =	 {978-1-60558-175-0}, 
  location =	 {Seattle, WA, USA}, 
  pages =	 {63--74}, 
  numpages =	 {12}, 
  url =		 {http://doi.acm.org/10.1145/1402958.1402967}, 
  doi =		 {http://doi.acm.org/10.1145/1402958.1402967}, 
  acmid =	 {1402967}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
  keywords =	 {data center topology, equal-cost routing}, 
}  
 
 
@inproceedings{Dcell08, 
  author =	 {Guo, Chuanxiong and Wu, Haitao and Tan, Kun and Shi, 
                  Lei and Zhang, Yongguang and Lu, Songwu}, 
  title =	 {Dcell: a scalable and fault-tolerant network 
                  structure for data centers}, 
  booktitle =	 {Proceedings of the ACM SIGCOMM 2008 conference on 
                  Data communication}, 
  series =	 {SIGCOMM '08}, 
  year =	 {2008}, 
  isbn =	 {978-1-60558-175-0}, 
  location =	 {Seattle, WA, USA}, 
  pages =	 {75--86}, 
  numpages =	 {12}, 
  url =		 {http://doi.acm.org/10.1145/1402958.1402968}, 
  doi =		 {http://doi.acm.org/10.1145/1402958.1402968}, 
  acmid =	 {1402968}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
  keywords =	 {data center, fault-tolerance, network topology, 
                  throughput}, 
}  
 
@inproceedings{Bcube09, 
  author =	 {Guo, Chuanxiong and Lu, Guohan and Li, Dan and Wu, 
                  Haitao and Zhang, Xuan and Shi, Yunfeng and Tian, 
                  Chen and Zhang, Yongguang and Lu, Songwu}, 
  title =	 {BCube: a high performance, server-centric network 
                  architecture for modular data centers}, 
  booktitle =	 {Proceedings of the ACM SIGCOMM 2009 conference on 
                  Data communication}, 
  series =	 {SIGCOMM '09}, 
  year =	 {2009}, 
  isbn =	 {978-1-60558-594-9}, 
  location =	 {Barcelona, Spain}, 
  pages =	 {63--74}, 
  numpages =	 {12}, 
  url =		 {http://doi.acm.org/10.1145/1592568.1592577}, 
  doi =		 {http://doi.acm.org/10.1145/1592568.1592577}, 
  acmid =	 {1592577}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
  keywords =	 {modular data center, multi-path, server-centric 
                  network} 
} 
 
@inproceedings{secondNet10, 
  author =	 {Guo, Chuanxiong and Lu, Guohan and Wang, Helen 
                  J. and Yang, Shuang and Kong, Chao and Sun, Peng and 
                  Wu, Wenfei and Zhang, Yongguang}, 
  title =	 {SecondNet: a data center network virtualization 
                  architecture with bandwidth guarantees}, 
  booktitle =	 {Proceedings of the 6th International COnference}, 
  series =	 {Co-NEXT '10}, 
  year =	 {2010}, 
  location =	 {Philadelphia, Pennsylvania}, 
  pages =	 {15:1--15:12}, 
  articleno =	 {15}, 
  numpages =	 {12}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
  keywords =	 {DCN, bandwidth guarantee, virtual data center}, 
}  
 
@Misc{cisco-pod, 
  author =	 {Cisco}, 
  title =	 {Cisco Virtualized Multi-Tenant Data Center, Version 2.0 Compact Pod Design Guide}, 
  howpublished = {\url{http://www.cisco.com/en/US/docs/solutions/Enterprise/Data_Center/VMDC/2.0/design_guide/vmdcCPoDDesign20.pdf}}, 
  annote =	 {} 
} 
 
@inproceedings{cloudward10, 
 author = {Hajjat, Mohammad and Sun, Xin and Sung, Yu-Wei Eric and Maltz, David and Rao, Sanjay and Sripanidkulchai, Kunwadee and Tawarmalani, Mohit}, 
 title = {Cloudward bound: planning for beneficial migration of enterprise applications to the cloud}, 
 booktitle = {Proceedings of the ACM SIGCOMM 2010 conference on SIGCOMM}, 
 series = {SIGCOMM '10}, 
 year = {2010}, 
 isbn = {978-1-4503-0201-2}, 
 location = {New Delhi, India}, 
 pages = {243--254}, 
 numpages = {12}, 
 url = {http://doi.acm.org/10.1145/1851182.1851212}, 
 doi = {http://doi.acm.org/10.1145/1851182.1851212}, 
 acmid = {1851212}, 
 publisher = {ACM}, 
 address = {New York, NY, USA}, 
 keywords = {cloud computing, enterprise applications, network configurations, performance modeling, security policies}, 
}  
 
@inproceedings{cloudpolice10, 
 author = {Popa, Lucian and Yu, Minlan and Ko, Steven Y. and Ratnasamy, Sylvia and Stoica, Ion}, 
 title = {CloudPolice: taking access control out of the network}, 
 booktitle = {Proceedings of the Ninth ACM SIGCOMM Workshop on Hot Topics in Networks}, 
 series = {Hotnets '10}, 
 year = {2010}, 
 isbn = {978-1-4503-0409-2}, 
 location = {Monterey, California}, 
 pages = {7:1--7:6}, 
 articleno = {7}, 
 numpages = {6}, 
 url = {http://doi.acm.org/10.1145/1868447.1868454}, 
 doi = {http://doi.acm.org/10.1145/1868447.1868454}, 
 acmid = {1868454}, 
 publisher = {ACM}, 
 address = {New York, NY, USA}, 
}  
 
 
@article{naor09, 
  author =	 {N. Buchbinder and J. Naor}, 
  title =	 {Online Primal-Dual Algorithms for Covering and Packing}, 
  journal =	 {Math. Oper. Res.}, 
  volume =	 34, 
  number =	 2, 
  year =	 2009, 
  pages =	 {270-286} 
} 
 
 
@Misc{otv, 
  author =	 {Cisco}, 
  title =	 {Overlay Transport Virtualization (OTV)}, 
  howpublished = {\url{http://www.cisco.com/en/US/prod/switches/ps9441/nexus7000_promo.html}}, 
  annote =	 {} 
} 
 
@Misc{vServiceDomain, 
  key =	 {{Cisco}}, 
  author =	 {{Cisco Inc and Vmware Inc}}, 
  title =	 {Virtual Networking Features of the VMware vNetwork Distributed Switch and Cisco Nexus 1000V Switches}, 
  year =	 {2009}, 
  howpublished = {available at \url{http://www.vmware.com/files/pdf/technology/cisco_vmware_virtualizing_the_datacenter.pdf}} 
} 
 
%http://www.voltaire.com/Products/Ethernet/voltaire_vantage_6024 
@Misc{v6024, 
  key =	 {{Voltaire Inc}}, 
  author =	 {{Voltaire Inc}}, 
  title =	 {Voltaire Vantage 6024 switch}, 
  year =	 {2010}, 
  howpublished = {available at \url{http://www.voltaire.com/Products/Ethernet/voltaire_vantage_6024}} 
} 
 
 
@Misc{IBMJuniperHybrid, 
  key =		 {{Computer World}}, 
  author =	 {{Computer World}}, 
  title =	 {{IBM}, {Juniper} join in cloud strategy: Technology 
                  would reallocate computing resources between 
                  private, public cloud}, 
  month =	 Feb, 
  year =	 2009, 
  howpublished = {\url{http://www.computerworld.com/s/article/9127702/IBM_Juniper_join_in_cloud_strategy}} 
} 
 
@Misc{viridity, 
  key =		 {{SearchDataCenter}}, 
  author =	 {{SearchDataCenter and Viridity}}, 
  title =	 {An Expert Guide to Data Center Trends, Energy 
                  Regulations, and More}, 
  year =	 2010 
} 
 
@Misc{IBMVSS, 
  key =		 {{IBM}}, 
  author =	 {{IBM}}, 
  title =	 {Installation Guide for Virtual Server Security for 
                  VMware (Proventia Server for VMware)}, 
  howpublished = 
                  {\url{http://documents.iss.net/literature/proventia/VSS_Installation_Guide.pdf}} 
} 
 
@inproceedings{TheoIMC09, 
  author =	 {Theophilus Benson and Aditya Akella and David Maltz 
                  }, 
  title =	 {Mining policies from enterprise network 
                  configuration}, 
  booktitle =	 {IMC}, 
  year =	 2009, 
} 
 
@Misc{CiscoL2ext, 
  key =		 {{Cisco Inc.}}, 
  author =	 {{Cisco Inc.}}, 
  title =	 {Data Center Interconnect: Layer 2 Extension Between 
                  Remote Data Centers}, 
  howpublished = {} 
} 
 
@INPROCEEDINGS{ReachabRexford05, 
  title =	 {On static reachability analysis of IP networks}, 
  author =	 {Xie, G.G. and Jibin Zhan and Maltz, D.A. and Hui 
                  Zhang and Greenberg, A. and Hjalmtysson, G. and 
                  Rexford, J.}, 
  booktitle =	 {INFOCOM 2005. 24th Annual Joint Conference of the 
                  IEEE Computer and Communications 
                  Societies. Proceedings IEEE}, 
  year =	 2005, 
  month =	 {March}, 
  volume =	 3, 
  number =	 {}, 
  pages =	 { 2170-2183 vol. 3}, 
  keywords =	 { IP networks, computer network reliability, failure 
                  analysis, reachability analysis, routing protocols 
                  IP networks, failure analysis, packet filters, 
                  packet transformations, routers, routing protocols, 
                  static reachability analysis}, 
  doi =		 {10.1109/INFCOM.2005.1498492}, 
  ISSN =	 {0743-166X } 
} 
 
@inproceedings{ResonanceFeamster09, 
  author =	 {Nayak, Ankur Kumar and Reimers, Alex and Feamster, 
                  Nick and Clark, Russ}, 
  title =	 {Resonance: dynamic access control for enterprise 
                  networks}, 
  booktitle =	 {WREN: Proceedings of the 1st ACM workshop on 
                  Research on enterprise networking}, 
  year =	 2009, 
  isbn =	 {978-1-60558-443-0}, 
  pages =	 {11--18}, 
  location =	 {Barcelona, Spain}, 
  doi =		 {http://doi.acm.org/10.1145/1592681.1592684}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA} 
} 
 
@inproceedings{complexAkella09, 
  author =	 {Benson, Theophilus and Akella, Aditya and Maltz, 
                  David}, 
  title =	 {Unraveling the complexity of network management}, 
  booktitle =	 {NSDI'09: Proceedings of the 6th USENIX symposium on 
                  Networked systems design and implementation}, 
  year =	 2009, 
  pages =	 {335--348}, 
  location =	 {Boston, Massachusetts}, 
  publisher =	 {USENIX Association}, 
  address =	 {Berkeley, CA, USA}, 
} 
 
@inproceedings{sysDesignMaltz08, 
  author =	 {Sung, Yu-Wei Eric and Rao, Sanjay G. and Xie, 
                  Geoffrey G. and Maltz, David A.}, 
  title =	 {Towards systematic design of enterprise networks}, 
  booktitle =	 {CONEXT '08: Proceedings of the 2008 ACM CoNEXT 
                  Conference}, 
  year =	 2008, 
  isbn =	 {978-1-60558-210-8}, 
  pages =	 {1--12}, 
  location =	 {Madrid, Spain}, 
  doi =		 {http://doi.acm.org/10.1145/1544012.1544034}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
} 
 
@article{emeFrancis07, 
  author =	 {Guha, Saikat and Francis, Paul}, 
  title =	 {An end-middle-end approach to connection 
                  establishment}, 
  journal =	 {SIGCOMM Comput. Commun. Rev.}, 
  volume =	 37, 
  number =	 4, 
  year =	 2007, 
  issn =	 {0146-4833}, 
  pages =	 {193--204}, 
  doi =		 {http://doi.acm.org/10.1145/1282427.1282403}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
} 
 
@inproceedings{Viaggre, 
  author =	 {Ballani, Hitesh and Francis, Paul and Cao, Tuan and 
                  Wang, Jia}, 
  title =	 {Making routers last longer with ViAggre}, 
  booktitle =	 {NSDI'09: Proceedings of the 6th USENIX symposium on 
                  Networked systems design and implementation}, 
  year =	 2009, 
  pages =	 {453--466}, 
  location =	 {Boston, Massachusetts}, 
  publisher =	 {USENIX Association}, 
  address =	 {Berkeley, CA, USA}, 
} 
 
@article{pswitch08, 
  author =	 {D. Joseph and A. Tavakoli and I. Stoica}, 
  title =	 {A policy-aware switching layer for data centers}, 
  journal =	 {CCR}, 
  year =	 2008, 
  doi =		 {http://doi.acm.org/10.1145/1402946.1402966}, 
} 
 
@inproceedings{middleboxNharm04, 
  author =	 {Walfish, Michael and Stribling, Jeremy and Krohn, 
                  Maxwell and Balakrishnan, Hari and Morris, Robert 
                  and Shenker, Scott}, 
  title =	 {Middleboxes no longer considered harmful}, 
  booktitle =	 {OSDI'04: Proceedings of the 6th conference on 
                  Symposium on Opearting Systems Design \& 
                  Implementation}, 
  year =	 {2004}, 
  pages =	 {15--15}, 
  location =	 {San Francisco, CA}, 
  publisher =	 {USENIX Association}, 
  address =	 {Berkeley, CA, USA}, 
} 
 
%The OpenFlow Switch Specification. Available at http://OpenFlowSwitch.org. 
@Misc{openflow, 
  author =	 {{Openflow}}, 
  title =	 {The OpenFlow Switch Specification}, 
  howpublished = {\url{http://OpenFlowSwitch.org}}, 
} 
 
@article{1355746, 
  author =	 {McKeown, Nick and Anderson, Tom and Balakrishnan, 
                  Hari and Parulkar, Guru and Peterson, Larry and 
                  Rexford, Jennifer and Shenker, Scott and Turner, 
                  Jonathan}, 
  title =	 {OpenFlow: enabling innovation in campus networks}, 
  journal =	 {SIGCOMM Comput. Commun. Rev.}, 
  volume =	 {38}, 
  number =	 {2}, 
  year =	 {2008}, 
  issn =	 {0146-4833}, 
  pages =	 {69--74}, 
  doi =		 {http://doi.acm.org/10.1145/1355734.1355746}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
} 
 
 
@article{Ethane07, 
 author = {Casado, Martin and Freedman, Michael J. and Pettit, Justin and Luo, Jianying and McKeown, Nick and Shenker, Scott}, 
 title = {Ethane: taking control of the enterprise}, 
 journal = {SIGCOMM Comput. Commun. Rev.}, 
 volume = {37}, 
 number = {4}, 
 year = {2007}, 
 issn = {0146-4833}, 
 pages = {1--12}, 
 doi = {http://doi.acm.org/10.1145/1282427.1282382}, 
 publisher = {ACM}, 
 address = {New York, NY, USA}, 
 } 
 
%T. F. Abdelzaher, C. Lu, "Modeling and Performance 
%Control of Internet Servers", Invited Paper, 39th IEEE 
%Conference on Decision and Control, Sydney, Australia, 
%December 2000. 
@inproceedings{Abdel00, 
 author = {T. F. Abdelzaher and C. Lu}, 
 title = {Modeling and Performance Control of Internet Servers}, 
 booktitle = {39th IEEE Conference on Decision and Control}, 
 year = {2000}, 
 month = December, 
 location = {Sydney, Australia} 
 } 
@inproceedings{ShaSvrCtrl05, 
  author =		 {Liu, Xue and Zheng, Rong and Heo, Jin and Sha, Lui}, 
  title =		 {Improved timing control for web server systems using 
                  internal state information}, 
  booktitle =	 {WWW '05: Special interest tracks and posters of the 
                  14th international conference on World Wide Web}, 
  year =		 {2005}, 
  isbn =		 {1-59593-051-5}, 
  pages =		 {1068--1069}, 
  location =	 {Chiba, Japan}, 
  doi =			 {http://doi.acm.org/10.1145/1062745.1062872}, 
  publisher =	 {ACM}, 
  address =		 {New York, NY, USA}, 
} 
@inproceedings{ShaSvrCtrl02, 
  author =		 {Sha, Lui and Liu, Xue and Lu, Ying and Abdelzaher, 
                  Tarek}, 
  title =		 {Queueing Model Based Network Server Performance 
                  Control}, 
  booktitle =	 {RTSS '02: Proceedings of the 23rd IEEE Real-Time 
                  Systems Symposium}, 
  year =		 {2002}, 
  isbn =		 {0-7695-1851-6}, 
  pages =		 {81}, 
  publisher =	 {IEEE Computer Society}, 
  address =		 {Washington, DC, USA}, 
} 
@inproceedings{NiehRespTime06, 
  author =		 {Olshefski, David and Nieh, Jason}, 
  title =		 {Understanding the management of client perceived 
                  response time}, 
  booktitle =	 {SIGMETRICS '06/Performance '06: Proceedings of the 
                  joint international conference on Measurement and 
                  modeling of computer systems}, 
  year =		 {2006}, 
  isbn =		 {1-59593-319-0}, 
  pages =		 {240--251}, 
  location =	 {Saint Malo, France}, 
  doi =			 {http://doi.acm.org/10.1145/1140277.1140305}, 
  publisher =	 {ACM}, 
  address =		 {New York, NY, USA}, 
} 
@inproceedings{ElniketyAdmCtrl, 
  author =		 {Elnikety, Sameh and Nahum, Erich and Tracey, John 
                  and Zwaenepoel, Willy}, 
  title =		 {A method for transparent admission control and 
                  request scheduling in e-commerce web sites}, 
  booktitle =	 {WWW '04: Proceedings of the 13th international 
                  conference on World Wide Web}, 
  year =		 {2004}, 
  isbn =		 {1-58113-844-X}, 
  pages =		 {276--286}, 
  location =	 {New York, NY, USA}, 
  doi =			 {http://doi.acm.org/10.1145/988672.988710}, 
  publisher =	 {ACM}, 
  address =		 {New York, NY, USA}, 
} 
@Misc{Amazon-ELB, 
  author =	 {Amazon AWS}, 
  title =	 {Amazon elastic load balancing}, 
  howpublished = {\url{http://aws.amazon.com/elasticloadbalancing}}, 
  annote =	 {} 
} 
@Misc{Amazon-AS, 
  author =		 {Amazon AWS}, 
  title =		 {Amazon auto-scaling}, 
  howpublished = {\url{http://aws.amazon.com/autoscaling}}, 
  annote =		 {} 
} 
@Misc{Rightscale, 
  author =		 {Rightscale}, 
  title =		 {Rightscale Adaptable Automation Engine}, 
  howpublished = 
                  {http://www.rightscale.com/products/features/adaptable-automation-engine.php}, 
  annote =		 {} 
} 
@Misc{constHash-imp, 
  author =	 {Tom White}, 
  title =	 {Consistent Hashing}, 
  howpublished = {\url{http://www.cloudera.com/node/27}}, 
  annote =	 {} 
} 
@inproceedings{consistentHashKarger, 
  author =		 {Karger, David and Lehman, Eric and Leighton, Tom and 
                  Panigrahy, Rina and Levine, Matthew and Lewin, 
                  Daniel}, 
  title =		 {Consistent hashing and random trees: distributed 
                  caching protocols for relieving hot spots on the 
                  World Wide Web}, 
  booktitle =	 {STOC '97: Proceedings of the twenty-ninth annual ACM 
                  symposium on Theory of computing}, 
  year =		 {1997}, 
  isbn =		 {0-89791-888-6}, 
  pages =		 {654--663}, 
  location =	 {El Paso, Texas, United States}, 
  doi =			 {http://doi.acm.org/10.1145/258533.258660}, 
  publisher =	 {ACM}, 
  address =		 {New York, NY, USA}, 
} 
@Misc{nginx, 
  author =		 {Igor Sysoev}, 
  title =		 {Nginx: a lightweight, high performance web 
                  server/reverse proxy}, 
  howpublished = {http://nginx.net/} 
} 
@Misc{amazon-vpc, 
  author =		 {{Amazon AWS}}, 
  title =		 {Amazon Virtual Private Cloud}, 
  howpublished = {http://aws.amazon.com/vpc/}, 
} 
 
%ISBN: 978-0-471-41550-3 
%February 2002 
@Book{ldb-bookChandra, 
  author =		 {Chandra Kopparapu}, 
  title =		 {Load Balancing Servers, Firewalls, and Caches}, 
  publisher =	 {Wiley}, 
  year =		 2002 
} 
 
@rfc{RFC2547, 
 author = {Rosen, E. and Rekhter, Y.}, 
 title = {{BGP/MPLS VPNs}}, 
 year = {1999}, 
 publisher = {RFC Editor}, 
 address = {United States} 
 } 
 
%Michael Armbrust, Armando Fox, Rean Griffith, Anthony D. Joseph, 
%Randy H. Katz, Andrew Konwinski, Gunho Lee, David A. Patterson, Ariel 
%Rabkin, Ion Stoica, and Matei Zaharia. Above the clouds: A berkeley view 
%of cloud computing. Technical Report UCB/EECS-2009-28, EECS Department, 
%University of California, Berkeley, Feb 2009. 
 
%P. Ruth, J. Rhee, D. Xu, R. Kennell, and S. Goasguen. Autonomic live adaptation 
%of virtual computational environments in a multi-domain infrastructure. 
%In ICAC '06: Proceedings of the 2006 IEEE International Conference 
%on Autonomic Computing, Washington, DC, USA, 2006. 
 
%[10] Ananth I. Sundararaj and Peter A. Dinda. Towards virtual networks for virtual 
%machine grid computing. In VM'04: Proceedings of the 3rd conference 
%on Virtual Machine Research And Technology Symposium, 2004. 
@InProceedings{VSITE-L2, 
  author =	  {Li Erran Li and Thomas Woo}, 
  title =	  {VSITE-L2: Seamless Layer 2 extension of enterprise sites in the cloud}, 
  booktitle =	  {Bell Labs Tech Report}, 
  year =	  2009 
} 

@InProceedings{VSITE, 
  author =		 {Li Erran Li and Thomas Woo}, 
  title =		 {VSITE: A Scalable Architecture for Enterprise 
                  Extension in the Cloud}, 
  booktitle =	 {Submitted to Hotnets}, 
  year =		 2009 
} 
@InProceedings{visa09, 
  author =	  {Fan Hao, and et al}, 
  title =	  {Enhancing Dynamic Cloud-based Services using Network Virtualization}, 
  booktitle =	  {workshop on Virtualized Infrastructure Systems and Architectures}, 
  year =	  2009 
} 
@InProceedings{mdomain06, 
  author =	  {P. Ruth, J. Rhee, D. Xu, R. Kennell and S. Goasguen}, 
  title =	  {utonomic live adaptation of virtual computational environments in a multi-domain infrastructure}, 
  booktitle =	  {Proceedings of the 2006 IEEE International Conference on Autonomic Computing}, 
  year =	  2006 
} 
@InProceedings{VMGrid04, 
  author =	  {Ananth I. Sundararaj and Peter A. Dinda}, 
  title =	  {Towards virtual networks for virtual machine grid computing}, 
  booktitle =	  {Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium}, 
  year =	  2004 
} 
@Misc{rackable, 
  author =	 {Rackable systems}, 
  title =	 {{ICE} cube modular data center}, 
  howpublished = {\url{http://www.rackable.com/products/icecube.aspx}}, 
  annote =	 {} 
} 
 
@rfc{RFC2547m, 
  author =	 { Eric Rosen and Rahul Aggarwal}, 
  title =	 {Multicast in {MPLS/BGP IP VPNs}}, 
  year =	 {2009}, 
howpublished={\url{http://www.ietf.org/internet-drafts/draft-ietf-l3vpn-2547bis-mcast-08.txt}}, 
 address = {United States} 
 } 
 
@Misc{vpn-cubed, 
  author =	 {{Cohesive Flexible Technologies Corp}}, 
  title =	 {{VPN-Cubed}: customer controlled security for the 
                  cloud}, 
  howpublished = 
                  {\url{http://www.cohesiveft.com/Cube/VPN/VPN-Cubed_Custom_Enterprise_Configurations/}}, 
  annote =	 {} 
} 
 
@InProceedings{WoodVPC09, 
  author =	 {T. Wood and A. Gerber and K. K. Ramakrishnan and 
                  J. {Van Der Merwe}}, 
  title =	 {The case for Enterprise-Ready Virtual Private 
                  Clouds}, 
  booktitle =	 {USENIX HotCloud}, 
  year =	 2009, 
  month =	 Jun 
} 
@TechReport{BerkeleyAboveCloud09, 
  author =		 {Michael Armbrust et al}, 
  title =		 {Above the clouds: A berkeley view of cloud 
                  computing}, 
  institution =	 {UC Berkeley}, 
  year =		 {2009}, 
  number =		 { UCB/EECS-2009-28} 
} 
@InProceedings{VL2Greenberg09, 
  author =		 {Albert Greenberg and Navendu Jain and Srikanth 
                  Kandula and Changhoon Kim and Parantap Lahiri and 
                  Dave Maltz and Parveen Patel and Sudipta Sengupta}, 
  title =		 {VL2: A Scalable and Flexible Data Center Network}, 
  booktitle =	 {ACM SIGCOMM}, 
  year =		 2009, 
  month =		 Aug 
} 
@InProceedings{Portland09, 
  author =	  {Andreas Pamboris and Nathan Farrington and Nelson Huang and Pardis Miri and 
Sivasankar Radhakrishnan and Vikram Subramanya and Amin Vahdat}, 
  title =	  {PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric}, 
  booktitle =	  {ACM SIGCOMM}, 
  year =	  2009, 
  month =	  Aug 
} 
@inproceedings{SEATTLE08, 
 author = {Kim, Changhoon and Caesar, Matthew and Rexford, Jennifer}, 
 title = {Floodless in seattle: a scalable ethernet architecture for large enterprises}, 
 booktitle = {SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communication}, 
 year = {2008}, 
 isbn = {978-1-60558-175-0}, 
 pages = {3--14}, 
 location = {Seattle, WA, USA}, 
 doi = {http://doi.acm.org/10.1145/1402958.1402961}, 
 publisher = {ACM}, 
 address = {New York, NY, USA}, 
 } 
 
 
%Amazon elastic computing cloud. http://aws.amazon.com/ec2. 
%[2] Michael Armbrust, Armando Fox, Rean Griffith, Anthony D. Joseph, 
%Randy H. Katz, Andrew Konwinski, Gunho Lee, David A. Patterson, Ariel 
%Rabkin, Ion Stoica, and Matei Zaharia. Above the clouds: A berkeley view 
%of cloud computing. Technical Report UCB/EECS-2009-28, EECS Department, 
%University of California, Berkeley, Feb 2009. 
 
 
%[3] C. Clark, K. Fraser, S. Hand, J.G. Hansen, E. Jul, C. Limpach, I. Pratt, and 
%A. Warfield. Live migration of virtual machines. In Proceedings of NSDI, 
%May 2005. 
%[4] N. G. Duffield, Pawan Goyal, Albert Greenberg, Partho Mishra, K. K. Ramakrishnan, 
%and Jacobus E. Van der Merwe. Resource management with 
%hoses: point-to-cloud services for virtual private networks. IEEE/ACM 
%Transactions on Networking, 10(5), 2002. 
%[5] Elasticvapor blog: Virtual private cloud. 
%http://www.elasticvapor.com/2008/05/virtual-private-cloud-vpc.html. 
%[6] Google app engine. hthttp://code.google.com/appengine/. 
%[7] Michael Nelson, Beng-Hong Lim, and Greg Hutchins. Fast transparent 
%migration for virtual machines. In ATEC '05: Proceedings of the annual 
%conference on USENIX Annual Technical Conference, 2005. 
%[8] K. K. Ramakrishnan, Prashant Shenoy, and Jacobus Van der Merwe. Live 
%data center migration across wans: a robust cooperative context aware approach. 
%In INM '07: Proceedings of the SIGCOMM workshop on Internet 
%network management, 2007. 
%[9] P. Ruth, J. Rhee, D. Xu, R. Kennell, and S. Goasguen. Autonomic live adaptation 
%of virtual computational environments in a multi-domain infrastructure. 
%In ICAC '06: Proceedings of the 2006 IEEE International Conference 
%on Autonomic Computing, Washington, DC, USA, 2006. 
%[10] Ananth I. Sundararaj and Peter A. Dinda. Towards virtual networks for virtual 
%machine grid computing. In VM'04: Proceedings of the 3rd conference 
%on Virtual Machine Research And Technology Symposium, 2004. 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% Added by Haiyong 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer implementations 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{CSWH00, 
  author =	  {I. Clarke and O. Sandberg and B. Wiley and T. W. Hong}, 
  title =	  {Freenet: A Distributed Anonymous Information Storage 
                  and Retrieval System}, 
  booktitle =	  {{ICSI} Workshop on Design Issues in Anonymity and 
                  Unobservability}, 
  url =		  {http://freenet.sourceforge.net/icsi.ps.gz}, 
  year =	  2000, 
  month =	  Jul 
} 
@inproceedings{Nar05, 
  author    = {Sanjai Narain}, 
  title     = {Network Configuration Management via Model Finding}, 
  booktitle = {Proceedings of {LISA}}, 
  year      = {2005}, 
  pages     = {155-168} 
} 
@Misc{Ora00, 
  author =		 {A. Oram}, 
  title =		 {Gnutella and Freenet Represent True Technical 
                  Inovation}, 
  howpublished = {The O'Reilly Network (on-line)}, 
  month =		 Dec, 
  year =		 2000, 
  url = 
                  {http://www.oreillynet.com/pub/a/network/2000/05/12/magazine/gnutella.html} 
} 
@Misc{ComcastP2Pi, 
  author = {Richard Woundy and Jason Livingood}, 
  title =	 {Comcast Field Tests}, 
  howpublished = {{IETF} {P2P} infrastructure workshop, May 2008} 
} 
@Misc{azureus_encryption, 
  title =	 {{Message Stream Encryption}}, 
  howpublished = {http://www.azureuswiki.com/index.php/Message_Stream_Encryption} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer traffic identification / recognization 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{SSW04, 
  author =	 {Subhabrata Sen and Oliver Spatscheck and Dongmei Wang}, 
  title =	 {Accurate, Scalable in-network Identification of {P2P} Traffic Using Application Signatures}, 
  crossref =	 {www04} 
} 
@InProceedings{KPF05, 
  author =	 {Thomas Karagiannis and Dina Papagiannaki and Michalis Faloutsos}, 
  title =	 {{BLINC}: Multilevel Traffic Classification in the Dark}, 
  crossref =	 {sigcomm05} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer traffic measurement 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{SGD+02, 
  author =	 {Stefan Saroiu and Krishna P. Gummadi and Richard 
                  J. Dunn and Steven D. Gribble and Henry M. Levy}, 
  title =	 {An Analysis of {I}nternet Content Delivery Systems}, 
  crossref =	 {osdi02}, 
  doi =		 {http://doi.acm.org/10.1145/1060289.1060319}, 
  abstract =	 {UWTrace: net provider -- outbound dominates. 97% is 
                  TCP traffic, and 57% of TCP traffic is content 
                  delivery traffic, i.e., WWW, Akamai, Gnutella and 
                  Kazza. Kazaa traffic contributes 36.9% of the CDN 
                  TCP traffic. Their trace is good for motivating 
                  banning or rate limitting P2P traffic.} 
} 
@Article{NSY08, 
  author =	 {Akihiro Nakao and Kengo Sasaki and Shu Yamamoto}, 
  title =	 {A Remedy for Network Operators against Increasing 
                  {P2P} Traffic: Enabling Packet Cache for {P2P} 
                  Applications}, 
  journal =	 {{IEICE} Transactions on Communications}, 
  year =	 2008 
} 
@InProceedings{GDS+03, 
  author =	 {K. Gummadi and R. Dunn and S. Saroiu and S. Gribble 
                  and H. Levy and J. Zahorjan}, 
  title =	 {Measurement, Modeling, and Analysis of a 
                  Peer-to-Peer File-Sharing Workload}, 
  booktitle =	 "Proc. of {SOSP} '03", 
  year =	 2003, 
  abstract =	 {} 
} 
@Misc{cachelogic04, 
  author = {A. Parker}, 
  title =	 {The True Picture of Peer-to-Peer Filesharing}, 
  howpublished = {http://www.cachelogic.com}, 
  month = Jul, 
  year =	 2004 
} 
@Misc{wu07, 
  author =	 {Hequan Wu}, 
  title =	 {Challenges and Opportunities of {I}nternet 
                  Developments in {C}hina }, 
  howpublished = {{ICNP} 2007 Keynote}, 
  month =	 Oct, 
  year =	 2007 
} 
 
%http://www.ipoque.com/media/news/ipoques_2007_p2p_survey_to_be_presented_at_technology_reviews_emerging_technologies_conference_at_mit.html 
@Misc{ipoque07, 
  author = {ipoque}, 
  title =	 {{P2P} Survey}, 
  howpublished = {Emerging Technologies Conference at {MIT}}, 
  month = Sep, 
  year =	 2007 
} 
@Article{SW04,  
  author = {Subhabrata Sen and Jia Wang},  
  title = {Analyzing peer-to-peer traffic across large networks},  
  journal = {IEEE/ACM Trans. Netw.},  
  volume = {12},  
  number = {2},  
  year = {2004},  
  issn = {1063-6692},  
  pages = {219--232},  
  publisher = {IEEE Press},  
  address = {Piscataway, NJ, USA}, 
  doi = {http://dx.doi.org/10.1109/TNET.2004.826277} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer news articles about cost, bandwidth, etc 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@Misc{reuters, 
  author = {{ZDNet News}}, 
  title =	 {{ISPs} see costs of file sharing rise}, 
  howpublished = {http://news.zdnet.com/2100-9584_22-1009456.html}, 
  year =	 2003, 
  month =  May 
} 
 
%  howpublished = {\url{http://www.lightreading.com/document.asp?doc_id=31767}} 
@Misc{lightreading, 
  author = {Lightreading.com}, 
  title =	 {{P2P} Plagues Service Providers}, 
  year =	 2003, 
  month =  Apr, 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer measurment-based network analysis 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{LRW03,  
  author = {Nathaniel Leibowitz and Matei Ripeanu and Adam Wierzbicki}, 
  title = {Deconstructing the Kazaa Network}, 
  booktitle = {WIAPP '03: Proceedings of the The Third IEEE Workshop on Internet Applications}, 
  year = {2003}, 
  isbn = {0-7695-1972-5}, 
  pages = {112}, 
  publisher = {IEEE Computer Society}, 
  address = {Washington, DC, USA}, 
  abstract = {Confirms previous results. Net consumer -- inbound traffic dominates;  users pay network usage upfront} 
} 
@InProceedings{SWXZ07, 
  author =	 {Guobin Shen and Ye Wang and Yongqiang Xiong and Ben 
                  Y. Zhao and Zhi-Li Zhang}, 
  title =	 {{HPTP}: Relieving the Tension between {ISP}s and 
                  {P2P}}, 
  crossref =	 {iptps07}, 
  year =	 2007 
} 
@InProceedings{PGES05, 
  author = {J.A. Pouwelse and P. Garbacki and D.H.J. Epema and H.J. Sips},  
  title =  {The Bittorrent P2P File-Sharing System: Measurements And Analysis}, 
  crossref =	 {iptps05}, 
  abstract = {bittorrent network measurement-based performance: availability, integrity, flash crowd, download performance} 
} 
@Article{LKR05, 
  author = {J. Liang and R. Kumar and K. W. Ross}, 
  title = {The FastTrack Overlay: A Measurement Study},  
  journal =	 {Computer Networks Journal (Elsevier)}, 
  volume =	 50, 
  number =       6, 
  pages =	 {842--858}, 
  month =	 Apr, 
  year = 2006 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer design 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{BCC+06,  
  author = {Ruchir Bindal and Pei Cao and William Chan and Jan Medval and George Suwala and Tony Bates and Amy Zhang}, 
  title = {Improving Traffic Locality in {B}itTorrent via Biased Neighbor Selection},   
  crossref = {icdcs06},  
  abstract = {} 
} 
@InProceedings{RGZ06,  
  author = {Shansi Ren and Lei Guo and Xiaodong Zhang},  
  title = {{ASAP}: an AS-Aware Peer-Relay Protocol for High Quality VoIP}, 
  crossref = {icdcs06},  
  abstract = {} 
} 
@InProceedings{KGIR06,  
  author = {Raj Kumar Rajendran and Samrat Ganguly and Rauf Izmailov and Dan Rubenstein}, 
  title = {Performance Optimization of {VoIP} using an Overlay Network}, 
  crossref = {infocom06},  
  abstract = {} 
} 
@InProceedings{GR05,  
  author = {Christos Gkantsidis and Pablo Rodriguez Rodriguez}, 
  title = {Network Coding for Large Scale Content Distribution}, 
  crossref = {infocom05},  
  abstract = {} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% P2P simulation-based studies 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{BHP06,  
  author = {Ashwin Bharambe and Cormac Herley and Venkat Padmanabhan}, 
  title = {Analyzing and Improving a {BitTorrent} Network's Performance Mechanisms}, 
  crossref = {infocom06},  
  abstract = {} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer traffic shaping / throttling / rate limiting 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@Misc{packeteer, 
  author =	 {Packeteer}, 
  title =	 {Packeteer {PacketShaper}}, 
  howpublished = {http://www.packeteer.com/products/packetshaper}, 
  annote =	 {}, 
} 
@Misc{pcube, 
  author =	 {{P-Cube}}, 
  title =	 {{P-Cube}}, 
  howpublished = {http://www.p-cube.net/indexold.shtml}, 
  annote =	 {} 
} 
@Misc{sandvine, 
  author =	 {Sandvine}, 
  title =	 {Intelligent Broadband Network Management}, 
  howpublished = {http://www.sandvine.com}, 
  annote =	 {} 
} 
@Misc{cisco-nbar, 
  author =	 {Cisco}, 
  title =	 {Network-Based Application Recognition ({NBAR})}, 
  howpublished = {\url{www.cisco.com/univercd/cc/td/doc/product/software/ios122/122newft/122t/122t8/dtnbarad.htm}}, 
  annote =	 {} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer traffic caching 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{LB+02,  
  author = {N. Leibowitz and A. Bergman and R. Ben-Shaul and A. Shavit}, 
  title = {Are File Swapping Networks Cacheable? Characterizing {P2P} Traffic}, 
  booktitle = {Proceedings of {WCW}}, 
  year = 2002, 
  address = {Boulder, CO}, 
  abstract = {} 
} 
@InProceedings{WLR+04,  
  author = {Adam Wierzbicki and Nathaniel Leibowitz and Matei Ripeanu and Rafal Wozniak}, 
  title = {Cache Replacement Policies Revisited}, 
  booktitle = {Proc. of {GP2P}}, 
  year = 2004, 
  month = Apr, 
  address = {Chicago, IL}, 
  abstract = {} 
} 
@Misc{HHM08, 
  author = {M. Hefeeda and C. Hsu and K. Mokhtarian}, 
  title =	 {p{C}ache: A Proxy Cache for Peer-to-Peer Traffic}, 
  howpublished = {ACM SIGCOMM'08 Technical Demonstration}, 
} 
@TechReport{SH06,  
  author = {Osama Saleh and Mohamed Hefeeda}, 
  title = {Modeling and Caching of Peer-to-Peer Traffic},  
  institution =  {SMU},  
  year =         2006,  
  number =       {TR 2006-11},  
  url =          {\url{http://nsl.cs.surrey.sfu.ca/projects/p2p/caching_tr.pdf}}, 
} 
@Misc{cachelogic, 
  author = {{CacheLogic}}, 
  title =	 {Serving Cached Content}, 
  howpublished = {\url{http://www.cachelogic.com/products/cachepliance.php}}, 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer traffic control white papers 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@Misc{f5-rateshaping, 
  author =	 {{F5 White Paper}}, 
  title =	 {Bandwidth Management for Peer-to-Peer Applications}, 
  howpublished = {\url{http://www.f5.com/solutions/technology/rateshaping_wp.html}}, 
  year =	 2006, 
  month =        Jan, 
  annote =	 {} 
} 
@Misc{statelog, 
  author =	 {{Statelog White Paper}}, 
  title =	 {Peer-to-Peer and Bandwidth Management}, 
  howpublished = {\url{http://www.staselog.com/whitepaper-p2p.pdf}}, 
  year = 2004, 
  month = Mar, 
  annote = {} 
} 
@Misc{PCUBE-bandwidth, 
  author =	 {{P-CUBE White Paper}}, 
  title = {Controlling P2P Bandwidth Consumption}, 
  howpublished = {\url{www.p-cube.com/doc_root/products/Engage/WP_Controlling_P2P_Bandwidth_Use_31403.pdf}}, 
  year = 2003, 
  annote = {} 
} 
@Misc{PCUBE-analysis, 
  author =	 {{P-CUBE White Paper}}, 
  title = {Approaches to Controlling Peer to Peer Traffic: A Technical Analysis}, 
  howpublished = {\url{www.p-cube.com/doc_root/products/Engage/WP_Approaches_Controlling_P2P_Traffic_31403.pdf}}, 
  year = 2003, 
  annote = {} 
} 
@Misc{isp-charging, 
  title =	 {{ISP} Bandwidth Billing}, 
  author =	 {Steve Cerruti and Carl Wright}, 
  howpublished = {\url{http://www.servicelevel.net/rating_matters/newsletters/issue13.htm}}, 
  year =	 2002 
} 
@Article{Odlyzko01, 
  author =	 {Andrew Odlyzko}, 
  title =	 {Internet pricing and the history of communications}, 
  journal =	 {Computer Networks}, 
  year =	 2001, 
  volume =	 36, 
  number =	 {5--6}, 
  pages =	 {493--517}, 
  month =	 Aug 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer hostile ISP lists 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@Misc{badisps-a, 
  key =		 {Bad {ISPs}}, 
  title =	 {Bad {ISPs}}, 
  howpublished = {\url{http://www.azureuswiki.com/index.php/Bad_ISPs}}, 
  year =	 2004 
} 
@Misc{badisps-emule, 
  key =		 {Bandwidth Throttling {ISPs}}, 
  title =	 {List of {B}andwidth {T}hrottling {ISPs}}, 
  howpublished = {\url{http://www.filesharingweb.de/mediaWiki/index.php/English:List_of_Bandwidth_throttling_ISPs}}, 
  year =	 2004 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer incentives 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{GLM01, 
  author =	  {P. Golle and K. Leyton-Brown and I. Mironov and Mark 
                  Lillibridge2}, 
  title =	  {Incentives for Sharing in Peer-to-Peer Networks}, 
  crossref =	 {ec01}, 
  abstract =	  {We consider the free-rider problem in peer-to-peer 
                  file sharing networks such as Napster: that 
                  individual users are provided with no incentive for 
                  adding value to the network. We examine the design 
                  implications of the assumption that users will 
                  selfishly act to maximize their own rewards, by 
                  constructing a formal game theoretic model of the 
                  system and analyzing equilibria of user strategies 
                  under several novel payment mechanisms. We support 
                  and extend this work with results from experiments 
                  with a multi-agent reinforcement learning model.}, 
  url =           {http://crypto.stanford.edu/%7Epgolle/papers/peer.pdf} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer caching 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@Misc{Thai-caching, 
  title =	 {Thai {ISP} {C}uts {B}andwidth {C}osts with {N}ew 
                  {Peer-to-Peer} {T}ech}, 
  howpublished = 
                  {\url{http://www.prweb.com/releases/2006/5/prweb384405.htm}}, 
  year =	 2006, 
  month =	 May, 
  annote =	 {} 
} 
@InProceedings{KRP05, 
  author =	 {Thomas Karagiannis and Pablo Rodriguez and 
                  Konstantina Papagiannaki}, 
  title =	 {Should {I}nternet Service Providers Fear Peer-Assisted 
                  Content Distribution?}, 
  booktitle =	 {Proc. of IMC}, 
  year =	 {2005} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% peer-to-peer analysis 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{BLT06,  
  author = {Tian Bu and Yong Liu and Don Towsley}, 
  title = {On the {TCP}-Friendliness of {VoIP} Traffic}, 
  crossref = {infocom06},  
  abstract = {} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% P2P model 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{QS04, 
    author = {Dongyu Qiu and R. Srikant}, 
    title = {Modeling and performance analysis of {B}itTorrent-like peer-to-peer networks}, 
    crossref = {sigcomm04}, 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% Skype measurement / analysis 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@Misc{Skype, 
  title = {Skype}, 
  howpublished = {\url{http://www.skype.com}}, 
  year = 2003, 
  annote = {} 
} 
@InProceedings{BS06,  
  author = {Salman A. Baset and Henning Schulzrinne},  
  title = {An Analysis of the {S}kype Peer-to-Peer Internet Telephony Protocol}, 
  crossref = {infocom06},  
  abstract = {} 
} 
@InProceedings{GDJ06,  
  author = {Saikat Guha and Neil Daswani and Ravi Jain}, 
  title = {An Experimental Study of the {S}kype Peer-to-Peer {VoIP} System}, 
  crossref = {iptps06},  
  abstract = {} 
} 
@InProceedings{SFKT06,  
  author = {Kyoungwon Suh and Daniel Figueiredo and James F. Kurose and Don Towsley}, 
  title = {Characterizing and detecting Skype-Relayed Traffic}, 
  crossref = {infocom06},  
  abstract = {} 
} 
@InProceedings{WCJ05,  
  author = {Xinyuan Wang and Shiping Chen and Sushil Jajodia}, 
  title = {Tracking Anonymous Peer-to-Peer {VoIP} Calls on the Internet}, 
  crossref = {ccs05},  
  abstract = {} 
} 
@InProceedings{XY07, 
    author =	 {Haiyong Xie and Yang Richard Yang}, 
    title =	 {A Measurement-based Study of the {S}kype Peer-to-Peer {VoIP} Performance}, 
    crossref = {iptps07},  
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% P2P for streaming 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{GA04,  
  author = {Meng Guo and Mostafa H. Ammar}, 
  title = {Scalable live video streaming to cooperative clients using time shifting and video patching}, 
  crossref = {infocom04},  
  abstract = {} 
} 
@InProceedings{LJL+06,  
  author = {Xiaofei Liao and Hai Jin and Yunhao Liu and Lionel M. Ni and Dafu Deng},  
  title = {{AnySee}: Scalable Live Streaming Service Based on Inter-Overlay Optimization}, 
  crossref = {infocom06},  
  abstract = {} 
} 
@InProceedings{ZL+05,  
  author = {Xinyan Zhang and Jiangchuan Liu and Bo Li and Tak-Shing Peter Yum}, 
  title = {CoolStreaming/{DONet}: a data-driven overlay network for live media streaming}, 
  crossref = {infocom05},  
  abstract = {} 
}  
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% P2P papers from SIGCOMM '07 PC members 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{LUM06, 
    title =       {Rarest first and choke algorithms are enough}, 
    author =      {Arnaud Legout and Guillaume Urvoy-keller and Pietro Michiardi}, 
    crossref = {imc06},  
} 
@InProceedings{UM06, 
    title =       {Impact of Inner Parameters and Overlay Structure on the Performance of {BitTorrent}}, 
    author =      {Guillaume Urvoy-keller and Pietro Michiardi}, 
    booktitle =	 {Proceedings of 9th IEEE Global Internet Symposium}, 
    month =	 April, 
    year =	 2006, 
    address =	 {Barcelona, Spain}, 
} 
@techreport{LUM05, 
    author =      {Arnaud Legout and Guillaume Urvoy-keller and Pietro Michiardi}, 
    title = {Understanding {BitTorrent}: An Experimental Perspective}, 
    number =	 "inria-00000156", 
    month =	 Nov, 
    year =	 2005, 
} 
@InProceedings{KTCI04, 
    title =       {Can {ISPs} take the heat from Overlay Networks?}, 
    author =      {R. Keralapura and N. Taft and C-N. Chuah and G. Iannaccone}, 
  booktitle =	 {Proc. of {HotNets-III}}, 
  year =	 2004, 
  address =	 {San Diego, CA}, 
  month =	 Nov 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% TCP-based congestion control / capacity sharing 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{XSSK05, 
  author = {Yong Xia and Lakshminarayanan Subramanian and Ion Stoica and Shivkumar Kalyanaraman}, 
  title = {One More Bit Is Enough}, 
  crossref = {sigcomm05},  
  abstract = {} 
} 
@InProceedings{KHR02, 
  author = {D. Katabi and M. Handley and C. Rohrs}, 
  title = {Congestion Control for High Bandwidth-Delay Product Networks}, 
  crossref = {sigcomm02},  
  abstract = {} 
} 
@InProceedings{KK03, 
  author = {A. Kuzmanovic and E. Knightly}, 
  title = {{TCP-LP}: A Distributed Algorithm for Low Priority Data Transfer}, 
  crossref = {infocom03},  
  abstract = {} 
} 
@Article{KK06, 
  author = {A. Kuzmanovic and E. Knightly}, 
  title =  {{TCP-LP}: Low-Priority Service via End-Point Congestion Control}, 
  journal =	 ton, 
  year =	 2006, 
  volume =	 14, 
  number =	 4, 
  pages =	 {}, 
  month =	 Aug, 
  annote =	 {Journal version of \cite{KK03}.}, 
  url = {\url{http://www.cs.northwestern.edu/~akuzma/doc/TCP-LP-ToN.pdf}} 
} 
@InProceedings{AKD02, 
  author = {Arun Venkataramani and Ravi Kokku and Mike Dahlin}, 
  title = {{TCP Nice}: A Mechanism for Background Transfers}, 
  crossref = {osdi02},  
  abstract = {} 
} 
@Article{CGC01, 
  author = {Ken Carlberg and Panos Gevros and Jon Crowcroft}, 
  title = {Lower than best effort: a design and implementation}, 
  journal = {SIGCOMM Comput. Commun. Rev.}, 
  volume = {31},  
  number = {2 supplement},  
  year = {2001},  
  issn = {0146-4833},  
  pages = {244--265},  
  doi = {http://doi.acm.org/10.1145/844193.844208},  
  publisher = {ACM Press}, 
  address = {New York, NY, USA},  
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% traffic patterns 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{LPC+04, 
  author = {Anukool Lakhina and Konstantina Papagiannaki and Mark Crovella and Christophe Diot and Eric D. Kolaczyk and Nina Taft}, 
  title = {Structural Analysis of Network Traffic Flows}, 
  crossref = {sigmetrics04},  
  abstract = {} 
}  
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% conferences 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@Proceedings{www04, 
  title =	 {Proceedings of {WWW13}}, 
  booktitle =	 {Proceedings of {WWW13}}, 
  year =	 2004, 
  month =	 {May}, 
  address =	 {New York, NY} 
} 
@Proceedings{iptps06, 
  title =	 {Proc. of {IPTPS}},  
  booktitle =	 {Proc. of {IPTPS}},  
  year =	 2006, 
  month =	 Feb, 
key = {IPTPS 2006}, 
  address =	 {Santa Barbara, CA} 
} 
@Proceedings{iptps07, 
  title =	 {Proc. of {IPTPS}},  
  booktitle =	 {Proc. of {IPTPS}},  
  year =	 2007, 
  month =	 Feb, 
key = {IPTPS 2007}, 
  address =	 {Bellevue, WA} 
} 
@Proceedings{iptps05, 
  title =	 {Proceedings of 4th International Workshop on Peer-to-Peer Systems ({IPTPS'05})},  
  booktitle =	 {Proceedings of 4th International Workshop on Peer-to-Peer Systems ({IPTPS'05})},  
  year =	 2005, 
  month =	 {February}, 
  address =	 {Ithaca, NY} 
} 
@Proceedings{imc06, 
  title =	 "Proceedings of the {I}nternet Measurement Conference", 
  booktitle =	 {Proceedings of the {I}nternet Measurement Conference}, 
  address =	 {Rio de Janeiro, Brazil}, 
  month =	 Oct, 
  key =		 {IMC 2006}, 
  year =	 2006 
} 
@Proceedings{imc05, 
  title =	 "Proceedings of the {I}nternet Measurement Conference", 
  booktitle =	 {Proceedings of the {I}nternet Measurement Conference}, 
  address =	 {Berkeley, CA}, 
  month =	 Oct, 
  key =		 {IMC 2005}, 
  year =	 2005 
} 
@Proceedings{icdcs06, 
  title =	 "Proceedings of IEEE ICDCS '06", 
  booktitle =	 "Proceedings of IEEE ICDCS '06", 
  address =	 {Lisboa, Portugal}, 
  month =	 Jul, 
  year =	 2006, 
  key =		 {ICDCS 2006}, 
  url =		 {\url{http://http://icdcs2006.di.fc.ul.pt}} 
} 
 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
% --- end for P2P related  
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
@InProceedings{RTZ03, 
  author =	 "M. Roughan and M. Thorup and Y. Zhang", 
  title =	 "Traffic Engineering with Estimated Traffic Matrices", 
  crossref =	 {imc03}, 
  year =	 2003, 
} 
@misc{cplex, 
  key =	 {cplex}, 
  title =	 {{ILOG CPLEX}: optimization software}, 
  howpublished = {http://www.ilog.com/products/cplex/}, 
} 
@InProceedings{AA96, 
  author =	 {K. Almeroth and M. Ammar}, 
  title =	 {Collection and Modeling of the Join/Leave Behavior 
                  of Multicast Group Members in the MBone}, 
  crossref =	 "hpdc96", 
  http =	 {\url{http://imj.ucsb.edu/publications.html}} 
} 
@article{MGVK02, 
  author =	 {Zhuoqing Morley Mao and Ramesh Govindan and George 
                  Varghese and Randy H. Katz}, 
  title =	 {Route flap damping exacerbates {I}nternet routing 
                  convergence}, 
  journal =	 {Computer Communication Review}, 
  volume =	 {32}, 
  number =	 {4}, 
  year =	 {2002}, 
  issn =	 {0146-4833}, 
  pages =	 {221--233}, 
  doi =		 {http://doi.acm.org/10.1145/964725.633047}, 
  publisher =	 {ACM Press} 
} 
@article{APT79, 
  author = {Bengt Aspvall and Michael F Plass and Robert Endre Tarjan}, 
  title = {A linear-time algorithm for testing the truth of certain quantified boolean formulas}, 
  journal = {Information Processing Letters}, 
  volume = {8}, 
  number = {3}, 
  pages = {121-123}, 
  year = {1979} 
} 
@InCollection{Fri04, 
  author =	 {Eric Friedman}, 
  editor =	 {K. Tumer and D. Wolpert}, 
  booktitle =	 {Collectives and the Design of Complex Systems}, 
  title =	 {Asynchronous Learning in Decentralized Environments: 
                  A Game Theoretic Approach}, 
  publisher =	 {Springer-Verlag}, 
  year =	 2004 
} 
@Article{FSSS04, 
  author =	 {Eric Friedman and Mikhael Shor and Scott Shenker and 
                  Barry Sopher}, 
  title =	 {An Experiment on Learning with Limited Information: 
                  Nonconvergence, Experimentation Cascades, and the 
                  Advantage of Being Slow}, 
  journal =	 {Games and Economic Behavior}, 
  year =	 2004, 
  volume =	 47, 
  number =	 2, 
  pages =	 {325--352}, 
  abstract =	 {We present the results of an experiment on learning 
                  in a continuous-time low-information setting. For a 
                  dominance solvable version of a Cournot oligopoly 
                  with differentiated products, we find little 
                  evidence of convergence to the Nash equilibrium. In 
                  an asynchronous setting, characterized by players 
                  updating their strategies at different frequencies, 
                  play tends toward the Stackelberg outcome which 
                  favors the slower player. Convergence is 
                  significantly more robust for a "serial cost 
                  sharing" game, which satisfies a stronger solution 
                  concept of overwhelmed solvability. As the number of 
                  players grows, this improved convergence tends to 
                  diminish, seemingly driven by frequent and highly 
                  structured experimentation by players leading to a 
                  cascading effect in which experimentation by one 
                  player induces experimentation by others. These 
                  results have implications both for traditional 
                  oligopoly competition and for a wide variety of 
                  strategic situations arising on the Internet} 
} 
@Article{BFSW04, 
  author =	 {D. Boneh and J. Feigenbaum and A. Silberschatz and 
                  R. Wright}, 
  title =	 {{PORTIA}: Privacy, Obligations, and Rights in 
                  Technologies of Information Assessment}, 
  journal =	 {Data Engineering}, 
  year =	 2004, 
  volume =	 27, 
  number =	 1 
} 
@InProceedings{WXQS+05, 
  author =	 {Hao Wang and Haiyong Xie and Lili Qiu and Avi 
                  Silberschatz and Yang Richard Yang}, 
  title =	 {Optimal {ISP} Subscription for {I}nternet 
                  Multihoming: Algorithm Design and Implication 
                  Analysis}, 
  crossref =	 {infocom05}, 
  year =	 2005 
} 
@InProceedings{AA97, 
  author =	 {O. Ait-Hellal and E. Altman}, 
  title =	 {Analysis of {TCP} {V}egas and {TCP} {R}eno}, 
  booktitle =	 {IEEE ICC '97}, 
  year =	 1997, 
  url =		 {}, 
  abstract =	 {Vegas} 
} 
@article{HY98, 
  author =	 {Ching-Yao Huang and Roy D. Yates}, 
  title =	 {Rate of convergence for minimum power assignment 
                  algorithms in cellular radio systems}, 
  journal =	 {Wireless Networks}, 
  volume =	 4, 
  number =	 3, 
  year =	 1998, 
  issn =	 {1022-0038}, 
  pages =	 {223--231}, 
  doi =		 {\url{http://dx.doi.org/10.1023/A:1019156106722}}, 
  publisher =	 {Kluwer Academic Publishers}, 
} 
@Article{FR01, 
  author =	 {Anja Feldmann and Jennifer Rexford}, 
  title =	 {{IP} network configuration for intradomain traffic 
                  engineering}, 
  journal =	 {{IEEE} Network Magazine}, 
  year =	 2001, 
  pages =	 {46--57}, 
  month =	 {Sept./Oct.} 
} 
@InProceedings{AAB00, 
  author =	 {Eitan Altman and Kostia Avrachenkov and Chadi 
                  Barakat}, 
  title =	 {A Stochastic Model of {TCP/IP} with Stationary 
                  Random Losses}, 
  crossref =	 "sigcomm00", 
  annote =	 {Using stochastic equation and palm inversibility.}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm2000/conf/paper/sigcomm2000-7-2.ps.gz}} 
} 
@article{lamport78, 
 author = {Leslie Lamport}, 
 title = {Time, clocks, and the ordering of events in a distributed system}, 
 journal = {Communications of the {ACM}}, 
 volume = {21}, 
 number = {7}, 
 year = {1978}, 
 issn = {0001-0782}, 
 pages = {558--565}, 
 doi = {http://doi.acm.org/10.1145/359545.359563}, 
 publisher = {ACM Press} 
 } 
@InProceedings{AAV02, 
  author =	 {E. Altman and R. El Azouzi and A. Vyacheslav}, 
  title =	 {Non-Cooperative Routing in Loss Networks}, 
  booktitle =	 {Proceedings of Performance 2002}, 
  year =	 2002, 
  address =	 {Rome, Italy}, 
  month =	 Sep, 
  url =		 {\url{http://www.inria.fr/rrrt/rr-4405.html}} 
} 
@Article{ABEJ00, 
  author =	 {E. Altman and T. Boulogne and R. El Azouzi and 
                  T. Jimenez }, 
  title =	 {A Survey on Networking Games}, 
  journal =	 {Telecommunication Systems}, 
  year =	 2000, 
  month =	 Nov, 
  url = 
                  {\url{http://www-sop.inria.fr/mistral/personnel/Eitan.Altman/PAPERS/srvgm.ps}} 
} 
@InProceedings{ABKM01, 
  title =	 {Resilient Overlay Networks}, 
  author =	 {David G. Andersen and Hari Balakrishnan and M. Frans 
                  Kaashoek and Robert Morris}, 
  crossref =	 {sosp01}, 
  abstract =	 {RON}, 
  url =		 {\url{http://nms.lcs.mit.edu/papers/ron-sosp2001.html}} 
} 
@Article{ABOS93, 
  author =	 {F. Alvarez-Cuevas and M. Bertran and F. Oller and 
                  J. Selga}, 
  title =	 {Voice synchronization in Packet Switched Networks}, 
  journal =	 {IEEE Network Magazine}, 
  year =	 1993, 
  volume =	 7, 
  number =	 5, 
  pages =	 {20--25}, 
  month =	 sep, 
  abstract =	 {If delay distribution is known ahead of time, we can 
                  use a fixed playout delay such that no more than a 
                  given fraction of arriving packets are lost due to 
                  late arrival. But the problem is the distribution 
                  not known. Even worse, the distribution can change 
                  over relatively short time scale} 
} 
@InProceedings{Rou05, 
  author =	 {Matthew Roughan}, 
  title =	 {First Order Characterization of {I}nternet Traffic 
                  Matrices}, 
  booktitle =	 {Proceedings of the 55th Session of the International 
                  Statistics Institute}, 
  year =	 2005, 
  address =	 {Sydney, Australia}, 
  month =	 Apr 
} 
 
http://internal.maths.adelaide.edu.au/people/mroughan/ 
@InProceedings{WCCL04, 
  author =	 {Hui Wang and Rocky K.C. Chang and Dah-Ming Chiu and 
                  John C.S. Lui}, 
  title =	 {Characterizing the Performance and Stability Issues 
                  of the {AS} Path Prepending Method: Taxonomy, 
                  Measurement Study and Analysis}, 
  booktitle =	 {Proceedings of {ACM} {SIGCOMM} Asia Workshop}, 
  year =	 2005, 
  month =	 Apr 
} 
@Article{CR05, 
  author =	 {Matthew Caesar and Jennifer Rexford}, 
  title =	 {{BGP} routing policies in {ISP} networks}, 
  journal =	 {IEEE Network Magazine}, 
  year =	 2005, 
  month =	 Nov 
} 
@InProceedings{GDZ05, 
  author =	 {Ruomei Gao and Constantinos Dovrolis and Ellen 
                  W. Zegura}, 
  title =	 {Interdomain Ingress Traffic Engineering through 
                  Optimized {AS}-Path Prepending}, 
  booktitle =	 {Proceedings of Networking'05}, 
  year =	 2005 
} 
@Unpublished{CZRS+04, 
  author =	 {Kartikeya Chandrayana and Yin Zhang and Matthew 
                  Roughan and Subhabrata Sen and Richard Karp}, 
  title =	 {Search Strategies in Inter-Domain Traffic 
                  Engineering}, 
  note =	 {Preprint}, 
  year =	 2004 
} 
@InProceedings{ACZ01, 
  author =	 {Joe Albowicz and Alvin Chen and Lixia Zhang}, 
  title =	 {Recursive position estimation in sensor networks}, 
  crossref =	 {icnp01}, 
  pages =	 {35--41}, 
  year =	 2001, 
  address =	 {Riverside, CA}, 
  month =	 Nov, 
  url =		 {\url{http://irl.cs.ucla.edu/papers/grab-icnp01.pdf}} 
} 
@InProceedings{ADLY95, 
  author =	 {J.S. Ahn and P.B. Danzig and Z. Liu and L. Yan}, 
  title =	 {Evaluation of {TCP} {V}egas: Emulation and 
                  Experiment}, 
  crossref =	 "sigcomm95", 
  year =	 1995, 
  url =		 {} 
} 
@InProceedings{AE03, 
  author =	 {Luzi Anderegg and Stephan Eidenbenz}, 
  title =	 {Ad hoc-{VCG}: a Truthful and Cost-Efficient Routing 
                  Protocol for Mobile Ad Hoc Networks With Selfish 
                  Agents}, 
  crossref =	 {mobicom03}, 
  year =	 2003, 
  url = 
                  {\url{http://zoo.cs.yale.edu/classes/cs434/readings/papers/AE03.pdf}} 
} 
@Article{AF99, 
  author =	 {M. Allman and A. Falk}, 
  title =	 {On the Effective Evaluation of {TCP}}, 
  journal =	 {{ACM} Communication Review}, 
  year =	 1999, 
  month =	 Oct, 
  url = 
                  {\urlhttp://www.acm.org/sigcomm/ccr/archive/1999/oct99/ccr-9910-allman2.html}} 
@InProceedings{AGWP01, 
  author =	 {W. Ashmawi and R. Guerin and S. Wolf and M. Pinson}, 
  title =	 {On the Impact of Policing and Rate Guarantees in 
                  Diff-Serv Networks: A Video Streaming Application 
                  Perspective}, 
  crossref =	 {sigcomm01}, 
  year =	 2001, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2001/p7.html}} 
} 
@InProceedings{AGY04, 
    author = {James Aspnes and David Goldenberg and Yang Richard Yang}, 
    title = {On the computational complexity of sensor network localization}, 
    crossref = {algosensors04}, 
    year = 2004, 
    note = {To appear} 
} 
@InProceedings{RS04, 
  author =	 {Barath Raghavan and Alex C. Snoeren}, 
  title =	 {A System for Authenticated Policy-Compliant Routing}, 
  crossref =	 {sigcomm04}, 
  year =	 2004 
} 
@InProceedings{AH97, 
  author =	 "Alfarez Abdul-Rahman and Stephen Hailes", 
  title =	 "A Distributed Trust Model", 
  booktitle =	 {New Security Paradigms '97}, 
  year =	 1997, 
  pages =	 "48--60", 
  url = 
                  {} 
} 
@MastersThesis{AH98, 
  author =	 {J. Andren and M. Hilding}, 
  title =	 {Real-time Determination of Traffic Conditions over 
                  the {I}nternet}, 
  school =	 {Chalmers University of Technology}, 
  year =	 1998, 
  address =	 {Gothenberg, Sweden}, 
  month =	 Jan, 
  abstract =	 {Statistical analysis of temporal correlation has 
                  been noted} 
} 
@InProceedings{AKRS94, 
  author =	 {C. M. Aras and J. F. Kurose and D. S. Reeves and 
                  H. Schulzrinne}, 
  title =	 {Real-time Communication in Packet-Switched Networks}, 
  booktitle =	 {Proceedings of {IEEE}}, 
  pages =	 {122--139}, 
  year =	 1994, 
  volume =	 82, 
  month =	 Jan, 
  abstract =	 {The dramatically increased bandwidths and processing 
                  capabilities of future high-speed networks offer the 
                  possibility of supporting myriad real-time 
                  communication applications, including packetized 
                  voice and video, sensor-based applications, and 
                  multimedia services in such networks. Since these 
                  applications will have traffic characteristics and 
                  performance requirements that are dramatically 
                  different from current data-oriented applications, 
                  new communication network architectures and 
                  protocols will be required. In this paper discuss 
                  the performance requirements and traffic 
                  characteristics of various real-time applications, 
                  survey recent developments in the areas of network 
                  architecture and protocol mechanisms for supporting 
                  real-time services, and develop frameworks in which 
                  these, and} 
} 
@article{AKW97, 
  author =	 "Abdo Y. Alfakih and Amir Khandani and Henry 
                  Wolkowicz", 
  title =	 "Solving {E}uclidean distance matrix completion 
                  problems via semidefinite programming", 
  journal =	 "Computat. Optim. Appl.", 
  volume =	 12, 
  number =	 "1-3", 
  pages =	 "13--30", 
  year =	 1999, 
  url =		 {}} 
@Article{ALWW+03, 
  author =	 {Khaled Alzoubi and Xiang-Yang Li and Yu Wang and 
                  Peng-Jun Wan and Ophir Frieder}, 
  title =	 {Geometric Spanners for Wireless Ad Hoc Networks}, 
  journal =	 {IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED 
                  SYSTEMS}, 
  year =	 2003, 
  volume =	 14, 
  number =	 5, 
  month =	 May, 
  url = 
                  {\url{http://ir.iit.edu/publications/downloads/TPDS-03.pdf}} 
} 
@InProceedings{AMI03, 
  title =	 {A Scalable and Lightweight {QoS} Monitoring 
                  Technique Combining Passive and Active Approaches}, 
  author =	 {Masaki Aida and Naoto Miyoshi and Keisuke Ishibashi}, 
  crossref =	 {infocom03}, 
  year =	 2003, 
  abstract =	 {To make a scalable and lightweight QoS monitoring 
                  system, we have proposed a new QoS monitoring 
                  technique, Change-of-Measure based Passive/Active 
                  Monitoring (CoMPACT Monitor), which is based on 
                  change-of-measure framework and is an active 
                  measurement transformed by using passively monitored 
                  data. This technique enables us to measure detailed 
                  QoS information for individual users, applications, 
                  and organizations, in a scalable and lightweight 
                  manner. In this paper, we present the mathematical 
                  foundation of CoMPACT Monitor. In addition, we show 
                  its characteristics through simulations in terms of 
                  typical implementation issues for inferring the 
                  delay distributions. The results show that CoMPACT 
                  Monitor gives accurate QoS estimations with only a 
                  small amount of extra traffic for active 
                  measurement.}, 
  annote =	 {CoMPACT}, 
  url =		 {\url{http://www.ieee-infocom.org/2003/papers/04_01.PDF}} 
} 
@InProceedings{AMSS03, 
  author =	 {Aditya Akella and Bruce Maggs and Srinivasan Seshan 
                  and Anees Shaikh and Ramesh Sitaraman}, 
  title =	 {A Measurement-Based Analysis of Multihoming}, 
  crossref =	 {sigcomm03}, 
  year =	 2003, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm2003/papers/p353-akella.pdf}} 
} 
@manual{APS99, 
  title =	 {{TCP} Congestion Control, {RFC} 2581}, 
  author =	 {M. Allman and V. Paxson and W. Stevens}, 
  year =	 1999, 
  month =	 Apr, 
  abstract =	 {TCP}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2581.html}} 
} 
@InProceedings{APSa99, 
  author =	 {George Apostolopoulos and Vinod Peris and Debanjan 
                  Saha}, 
  title =	 {Transport Layer Security: How much does it really 
                  cost?}, 
  crossref =	 "infocom99", 
  abstract =	 {} 
} 
@Article{AR97, 
  author =	 {M.J. Appel and R.P. Russo}, 
  title =	 {The maximum vertex degree of a graph on uniform 
                  points in $[0,1]^2$}, 
  journal =	 {Adv. Applied Probability}, 
  year =	 1997, 
  volume =	 29, 
  pages =	 {567--581}, 
} 
} 
@InProceedings{AS00, 
  author =	 {Rakesh Agrawal and Ramakrishnan Srikand}, 
  title =	 {Privacy preserving data mining}, 
  booktitle =	 {Proceedings of {ACM} {SIGMOD} Conference on 
                  Management of Data}, 
  year =	 2000, 
  month =	 May 
} 
@InProceedings{ASBJ99, 
  author =	 {W. Adjie-Winoto and E. Schwartz and H. Balakrishnan 
                  and J. Lilley}, 
  title =	 {The design and implementation of an intentional 
                  naming system}, 
  crossref =	 {sosp99}, 
  url =		 {\url{http://wind.lcs.mit.edu/papers/ins-sosp99.html}}, 
  year =	 1999 
} 
@Book{AMO93, 
  author =	 {R.K. Ahuja and T.L. Magnanti and J.B. Orlin}, 
  title =	 {Network Flows}, 
  publisher =	 {Prentice Hall}, 
  year =	 1993 
} 
@InCollection{Jac03, 
  author =	 {M. Jackson}, 
  editor =	 {G. Demange and M. Wooders}, 
  title =	 {A Survey of Models of Network Formation: Stability 
                  and Efficiency}, 
  booktitle =	 {Group Formation in Economics: Networks, Clubs, and 
                  Coalitions}, 
  publisher =	 {Cambridge University Press, Cambridge, UK}, 
  year =	 2003, 
  url = 
                  {\url{http://www.hss.caltech.edu/~jacksonm/netsurv.pdf}} 
} 
@InProceedings{ASKS02, 
  author =	 "A. Akella and S. Seshan and R. Karp and S. Shenker", 
  title =	 "Selfish Behavior and Stability of the {I}nternet: 
                  Game-Theoretic Analysis of {TCP}", 
  crossref =	 "sigcomm02", 
  month =	 Aug, 
  year =	 "2002", 
  address =	 "Pittsburgh, PA", 
} 
@InProceedings{ASNS97, 
  author =	 {D. Scott Alexander and Marianne Shaw and Scott 
                  M. Nettles and Jonathan M. Smith}, 
  title =	 {Active Bridging}, 
  crossref =	 {sigcomm97}, 
  url =		 {} 
} 
@Article{ASSC02, 
  author =	 {I. F. Akyildiz and W. Su and Y. Sankarasubramaniam 
                  and E. Cyirci}, 
  title =	 {Wireless Sensor Networks: A Survey}, 
  journal =	 {Computer Networks}, 
  year =	 2002, 
  volume =	 38, 
  number =	 4, 
  pages =	 {393--422}, 
  month =	 Mar 
} 
@InProceedings{ASW99, 
  title =	 {Towards making broadcast encryption practical}, 
  author =	 {M. Abdalla and Y. Shavitt and A. Wool}, 
  booktitle =	 {Financial Cryptography '99, LNCS 1648, 
                  Springer-Verlag}, 
  address =	 {Anguilla, BWI}, 
  year =	 {1999}, 
  month =	 Feb, 
  abstract =	 {Allow a controlled number of free-riders to improve 
                  performance} 
} 
} 
@InProceedings{ASW99, 
  title =	 {}, 
  author =	 {M. Langheinrich}, 
  booktitle =	 { '99, LNCS 1648, 
                  Springer-Verlag}, 
  address =	 {Anguilla, BWI}, 
  year =	 {1999}, 
  month =	 Feb, 
  abstract =	 {Allow a controlled number of free-riders to improve 
                  performance} 
} 
@InProceedings{AT02, 
  author =	 {A. Archer and E. Tardos}, 
  title =	 {Frugal Path Mechanisms}, 
  booktitle =	 {Proceedings of 13th Symposium on Discrete 
                  Algorithms}, 
  pages =	 {991--999}, 
  year =	 2002, 
  address =	 {New York/Philadelphia}, 
  organization = {ACM Presee/{SIAM}}, 
  annote =	 {Selfish unicast routing}, 
  url = 
                  {\url{http://www.orie.cornell.edu/~aarcher/Research/fpSODAproc.ps}} 
} 
@InCollection{AW02, 
  author =	 {E. Altman and L. Wynter}, 
  title =	 {Equilibrium, Games, and Pricing in Transportation 
                  and Telecommunications Networks}, 
  booktitle =	 {Networks and Spacial Economics}, 
  year =	 2002, 
  series =	 {Special issue on crossovers between transportation 
                  planning and telecommunications}, 
  month =	 Apr, 
  url = 
                  {\url{http://www-sop.inria.fr/mistral/personnel/Eitan.Altman/PAPERS/laura.ps}} 
} 
@InProceedings{AW92, 
  author =	 {M. H. Ammar and L. R. Wu}, 
  title =	 {Improving the throughput of point-to-multipoint 
                  {ARQ} protocols through destination set splitting}, 
  crossref =	 "infocom92", 
  abstract =	 {First DSG} 
} 
@techreport{AW98, 
  author =	 "A. Alfakih and H. Wolkowicz", 
  title =	 "On the embeddability of weighted graphs in 
                  {E}uclidean spaces", 
  number =	 "CORR 98-12", 
  year =	 1998, 
  abstract =	 {Given an incomplete edge-weighted graph, G = (V; E; 
                  !), G is said to be embeddable in ! r , or 
                  r-embeddable, if the vertices of G can be mapped to 
                  points in ! r such that every two adjacent vertices 
                  v i , v j of G are mapped to points x i , x j 2 ! r 
                  whose Euclidean distance is equal to the weight of 
                  the edge (v i ; v j ). Barvinok [3] proved that if G 
                  is r-embeddable for some r, then it is r -embeddable 
                  where r = b( p 8jEj + 1 \Gamma 1)=2c. In this paper 
                  we provide a}, 
  url = 
                  {} 
} 
@article{Aur91, 
  title =	 {Voronoi diagrams -- a survey of a fundamental 
                  geometric data structure}, 
  author =	 {Franz Aurenhammer}, 
  journal =	 {Computing Surveys}, 
  publisher =	 {ACM}, 
  volume =	 23, 
  pages =	 {345--406}, 
  year =	 1991, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/journals/surveys/1991-23-3/p345-aurenhammer/}} 
} 
@Article{Awd99, 
  author =	 {D. O. Awduche}, 
  title =	 {{MPLS} and Traffic Engineering in {IP} Networks}, 
  journal =	 {{IEEE} Communication Magazine}, 
  year =	 1999, 
  pages =	 {42--47}, 
  month =	 Dec 
} 
@Article{BAPK02, 
  author =	 {T. Boulogne and E. Altman and O. Pourtallier and 
                  H. Kameda}, 
  title =	 {Mixed Equilibrium for Multiclass Routing Games}, 
  journal =	 {{IEEE} Transactions on Automatic Control}, 
  year =	 2002, 
  volume =	 47, 
  number =	 6, 
  pages =	 {903--916}, 
  month =	 Jun, 
  url = 
                  {\url{http://www-sop.inria.fr/mistral/personnel/Eitan.Altman/PAPERS/mixed.ps}}, 
  annote =	 {} 
} 
@InProceedings{BAZSF97, 
  author =	 { Samrat Bhattacharjee and Mostafa H. Ammar and Ellen 
                  W. Zegura and Viren Shah and Zongming Fei } , 
  title =	 {{A}pplication-layer anycasting} , 
  crossref =	 {infocom97} , 
  volume =	 {3} , 
  year =	 1997 , 
  month =	 Apr 
} 
@TechReport{BB00, 
  author =	 {Deepak Bansal and Hari Balakrishnan}, 
  title =	 {{TCP}-friendly Congestion Control for Real-time 
                  Streaming Applications}, 
  institution =	 {Massachusetts Institute of Technology}, 
  year =	 2000, 
  number =	 {MIT--LCS--TR--806}, 
  address =	 {Cambridge, Massachusetts, U.S.A.}, 
  month =	 May 
} 
@InProceedings{BB01, 
  author =	 {Deepak Bansal and Hari Balakrishnan}, 
  title =	 {Binomial congestion control algorithms}, 
  crossref =	 "infocom01", 
  abstract =	 {Binomial congesiton control} 
} 
@TechReport{BB94, 
  author =	 {A. Bakre and B.R. Badrinath}, 
  title =	 {{I-TCP}: Indirect {TCP} for Mobile Hosts}, 
  institution =	 {Rutgers University}, 
  year =	 1994, 
  number =	 {DCS-TR-314}, 
  month =	 Oct, 
  url =		 {ftp://paul.rutgers.edu/pub/badri/itcp-tr314.ps.Z} 
} 
@Book{BB94stoc, 
  author =	 {Francois Baccelli and Pierre Bremaud}, 
  title =	 {Elements of queueing theory : {P}alm-{M}artingale 
                  calculus and stochastic recurrences}, 
  publisher =	 {Springer-Verlag}, 
  year =	 1994 
} 
@manual{BBCD+98, 
  author =	 {S. Blake and D. Black and M. Carlson and E. Davies 
                  and Z. Wang and W. Weiss}, 
  title =	 {An Architecture for Differentiated Services, {RFC} 
                  2475}, 
  month =	 Dec, 
  year =	 "1998", 
  abtract =	 {Diffserv}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2475.html}} 
} 
@InProceedings{EJLW04, 
  author =	 {Anwar Elwalid and Cheng Jin and Steven Low and Indra 
                  Widjaja}, 
  title =	 {{MATE}: {MPLS} Adaptive Traffic Engineering}, 
  crossref =	 {infocom01}, 
  year =	 2001, 
  url = 
                  {\url{http://www.eecs.umich.edu/~chengjin/infocom01_mate.pdf}} 
} 
@manual{ACEW+02, 
  author =	 {D. Awduche and A. Chiu and A. Elwalid and I. Widjaja 
                  and X. Xiao}, 
  title =	 {Overview and Principles of Internet Traffic 
                  Engineering, {RFC} 3272}, 
  month =	 May, 
  year =	 2002, 
  abtract =	 {}, 
  url = 
                  {\url{http://andrew2.andrew.cmu.edu/rfc/rfc3272.html}} 
} 
@InProceedings{BBCM92, 
  author =	 {Bob Blakley and G.R. Blakley and A.H. Chan and 
                  J.L. Massey}, 
  title =	 {Threshold Schemes with Disenrollment}, 
  pages =	 {540--548}, 
  booktitle =	 crypto92, 
  year =	 1992, 
  abstract =	 {threshold} 
} 
@InProceedings{BBFS01, 
  author =	 {Deepak Bansal and Hari Balakrishnan and Sally Floyd 
                  and Scott Shenker}, 
  title =	 {Dynamic Behavior of Slowly-Responsive Congestion 
                  Control Algorithms}, 
  crossref =	 {sigcomm01}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm2001/p21.html}} 
} 
@InProceedings{BBGMSZ00, 
  author =	 {Guruduth Banavar and James Beck and Eugene Gluzberg 
                  and Jonathan Munson and Jeremy Sussman and Deborra 
                  Zukowski}, 
  title =	 {An Application Model for Pervasive Computing}, 
  crossref =	 "mobicom00", 
  abstract =	 {The way mobile computing devices and applications 
                  are developed, deployed and used today does not meet 
                  the expectations of the user community and falls far 
                  short of the potential for pervasive computing. This 
                  paper challenges the mobile computing community by 
                  questioning the roles of devices, applications and 
                  the environment. A new vision of pervasive computing 
                  is described, along with attributes of a new 
                  application model that supports this vision, and a 
                  set of challenges that must be faced in order to 
                  bring the vision to reality. } 
} 
@InProceedings{BBHJ03, 
  author =	 {N. Ben Salem and L. Buttyan and J. P. Hubaux and 
                  M. Jakobsson}, 
  title =	 {A Charging and Rewarding Scheme for Packet 
                  Forwarding in Multi-hop Cellular Networks}, 
  crossref =	 {mobihoc03}, 
  year =	 2003, 
  url = 
                  {\url{http://lcawww.epfl.ch/Publications/BenSalem/BenSalemBHJ03.pdf}} 
} 
@InProceedings{BBK02, 
  title =	 {Scalable Application Layer Multicast}, 
  author =	 {Suman Banerjee and Bobby Bhattacharjee and 
                  Christopher Kommareddy}, 
  crossref =	 {sigcomm02}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm2002/papers/appmulti.html}} 
} 
@InProceedings{RWXZ02, 
  author =	 {Jennifer Rexford and Jia Wang and Zhen Xiao and Yin 
                  Zhang}, 
  title =	 {{BGP} routing stability of popular destinations}, 
  crossref =	 {imc02} 
} 
@InProceedings{BBTIDO02, 
  author =	 {Chadi Barakat and Patrick Thiran and Gianluca 
                  Iannaccone and Christophe Diot and Philippe 
                  Owezarski}, 
  title =	 {A Flow-based Model for {I}nternet Backbone Traffic}, 
  crossref =	 {imc02}, 
  year =	 2002, 
  url = 
                  {\url{http://www.icir.org/vern/imw-2002/imw2002-papers/123.pdf}}, 
  abstract =	 {Our goal is to design a traffic model for 
                  uncongested IP backbone links that is simple enough 
                  to be used in network operation, and that is 
                  protocol and application agnostic in order to be as 
                  general as possible. The proposed solution is to 
                  model the traffic at the flow level by a Poisson 
                  shot-noise process. In our model, a flow is a 
                  generic notion that must be able to capture the 
                  characteristics of any kind of data stream. We 
                  analyze the accuracy of the model with real traffic 
                  traces collected on the Sprint IP backbone 
                  network. Despite its simplicity, our model provides 
                  a good approximation of the real traffic observed in 
                  the backbone and of its variation. Finally, we 
                  discuss three applications of our model to network 
                  design and management.} 
} 
@InProceedings{BC00, 
  author =	 {Paul Barford and Mark Crovella}, 
  title =	 {Critical path analysis of {TCP} transactions}, 
  crossref =	 "sigcomm00", 
  abstract =	 {} 
} 
@InProceedings{ZG05, 
  author =	 {Yin Zhang and Zihui Ge}, 
  title =	 {Finding Critical Traffic Matrices}, 
  crossref =	 "dsn05", 
  abstract =	 {} 
} 
@InProceedings{BC95, 
  author =	 {Ballardie, A. and Crowcroft, J.}, 
  title =	 {Multicast-Specific Security Threats and Counter 
                  Measures}, 
  booktitle =	 {Symposium on Network and Distributed System 
                  Security}, 
  address =	 {San Diego, CA}, 
  year =	 1995, 
  month =	 Feb, 
  abstract =	 {Pointed out the need to secure IGMP. A host needs to 
                  present cryptographic credentials to join a 
                  router. However, there is mechanism do key 
                  distribution. And all authorization is done at the 
                  leaf router. To prevent flooding attack, the 
                  protocol try to randomly sample packets and punish 
                  the detected putative source} 
} 
@TechReport{BC98, 
  author =	 {Brian Whetten and Jim Conlan}, 
  title =	 {A Rate Based Congestion Control Scheme for Reliable 
                  Multicast, Working Draft}, 
  institution =	 {Globalcast Communications}, 
  year =	 {1998}, 
  month =	 nov, 
  abstract =	 {} 
} 
@manual{BCC+98, 
  author =	 {B. Braden and D. Clark and J. Crowcroft and B. Davie 
                  and S. Deering and D. Estrin and S. Floyd and 
                  V. Jacobson and G. Minshall and C. Partridge and 
                  L. Peterson and K. Ramakrishnan and S. Shenker and 
                  J. Wroclawski and L. Zhang}, 
  title =	 {Recommendations on Queue Management and Congestion 
                  Avoidance in the {I}nternet, {RFC} 2309}, 
  month =	 Apr, 
  year =	 1998, 
  url = 
                  {\url{http://snad.ncsl.nist.gov/itg/nistnet/draft-shivkuma-ecn-diffserv-00.txt}} 
} 
@InProceedings{BCDP97, 
  author =	 {A. Brodnik and S. Carlsson and M. Degermark and 
                  S. Pink}, 
  title =	 {Small Forwarding Tables for Fast Routing Lookups}, 
  crossref =	 "sigcomm97", 
  pages =	 {3--14}, 
  year =	 1997, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm97/papers/p192.html}} 
} 
@InProceedings{BCG95, 
  author =	 {Jean-Chrysostome Bolot and Hugues Cr\'{e}pin and 
                  Andres Vega Garcia}, 
  title =	 {Analysis of Audio Packet Loss in the {I}nternet}, 
  crossref =	 "nossdav95", 
  abstract =	 {Loss patterns} 
} 
@Article{EE04, 
  author =	 {Tamer ElBatt and Anthony Ephremides}, 
  title =	 {Joint Scheduling and Power Control for Wireless Ad 
                  Hoc Networks}, 
  journal =	 {IEEE Transactions on Wireless Communications}, 
  year =	 2004, 
  volume =	 3, 
  number =	 1, 
  pages =	 {74--85}, 
  month =	 Jan, 
  url =		 {\url{multi-hop power control}} 
} 
@inproceedings{BCP95, 
  author =	 {N. D. Bambos and S. C. Chen and G. J. Pottie}, 
  title =	 {Radio link admission algorithms for wireless 
                  networks with power control and active link quality 
                  protection}, 
  booktitle =	 {Proceedings of the Fourteenth Annual Joint 
                  Conference of the IEEE Computer and Communication 
                  Societies (Vol. 1)-Volume}, 
  year =	 1995, 
  isbn =	 {0-8186-6990-X}, 
  pages =	 97, 
  publisher =	 {IEEE Computer Society}, 
  annote =	 {active link protection} 
} 
@manual{BCS94, 
  author =	 {R. Braden and D. Clark and S. Shenker}, 
  title =	 {Integrated Services in the {I}nternet Architecture: 
                  an Overview, {RFC} 1633}, 
  year =	 "1994", 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1633.html}} 
} 
@InProceedings{BCSW98, 
  author =	 {S. Basagni and I. Chlamtac and V. R. Syrotiuk and 
                  B. A. Woodward}, 
  title =	 {A distance routing effect algorithm for mobility 
                  ({DREAM})}, 
  crossref =	 {mobicom98}, 
  pages =	 {76--84}, 
  year =	 1998, 
  annote =	 {DREAM; location service, each node knows the 
                  locations of all other nodes}, 
  url =		 {} 
} 
@InProceedings{QUB02, 
  author =	 {B. Quoitin and S. Uhlig and O. Bonaventure}, 
  title =	 {Using redistribution communities for Interdomain 
                  Traffic Engineering}, 
  booktitle =	 {{QoFIS'02} {LNCS} 2511}, 
  year =	 2002, 
  month =	 Oct, 
  url = 
                  {\url{http://www.info.ucl.ac.be/~bqu/downloads/48-quoitin.pdf}} 
} 
@Article{QUPS+02, 
  author =	 {B. Quoitin and S. Uhlig and C. Pelsser and 
                  L. Swinnen and O. Bonaventure}, 
  title =	 {Interdomain Traffic Engineering with {BGP}}, 
  journal =	 {IEEE Communications Magazine}, 
  year =	 2002, 
  volume =	 41, 
  number =	 5, 
  pages =	 {122--128}, 
  month =	 May, 
  url = 
                  {\url{http://www.infonet.fundp.ac.be/doc/tr/Infonet-TR-2002-08.html}} 
} 
@InProceedings{PTD04, 
  author =	 {Konstantina Papagiannaki and Nina Taft and 
                  Christophe Diot}, 
  title =	 {Impact of Flow Dynamics on Traffic Engineering 
                  Design Principles}, 
  crossref =	 {infocom04}, 
  url = 
                  {\url{http://www.cambridge.intel-research.net/~kpapagia/papers/infocom04.pdf}}, 
  year =	 2004, 
  annote =	 {use history to predict heavy hitters; the aest idea} 
} 
@InProceedings{BDJT01, 
  author =	 {Supratik Bhattacharyya and Christophe Diot and 
                  Jorjeta Jetcheva and Nina Taft}, 
  title =	 {Pop-Level and Access-Link-Level Traffic Dynamics in 
                  a Tier-1 {POP}}, 
  crossref =	 {imc01}, 
  year =	 2001, 
  url = 
                  {\url{http://www.icir.org/vern/imw-2001/imw2001-papers/58.pdf}}, 
  abstract =	 {In this paper, we study traffic demands in an IP 
                  bacbkone, identify the routes used by these demands, 
                  and evaluate traffic granularity levels that are 
                  attractive for improving the poor load balancing 
                  that our study reveals. The data used in this study 
                  was collected at a major POP in a commercial Tier-1 
                  IP backbone. In the first part of this paper we ask 
                  two questions. What is the traffic demand between a 
                  pair of POPs in the backbone? How stable is this 
                  demand? We develop a methodology that combines 
                  packet-level traces from access links in the POP and 
                  BGP routing information to build components of 
                  POP-to-POP traffic matrices. Our analysis shows that 
                  the geographic spread of traffic across egress POPs 
                  is far from uniform. In addition, we find that the 
                  time of day behaviors for different POPs and 
                  different access links also exhibit a high degree of 
                  heterogeneity. In the second part of this work, we 
                  examine commercial routing practices to assess how 
                  these demands are routed through the backbone. We 
                  find that traffic between a pair of POPs is 
                  engineered to be restricted to a few paths and that 
                  this contributes to widely varying link utilization 
                  levels. The natural question that follows from these 
                  findings is whether or not there is a better way to 
                  spread the traffic across backbone paths. We 
                  identify traffic aggregates based on destination 
                  address prefixes and find that this set of criteria 
                  isolates a few aggregates that account for an 
                  overwhelmingly large portion of inter-POP 
                  traffic. We demonstrate that these aggregates 
                  exhibit stability throughout the day on perhour time 
                  scales, and thus form a natural basis for splitting 
                  traffic over multiple paths to improve load 
                  balancing.} 
} 
@InProceedings{BDSZ94, 
  author =	 {V. Bharghavan and A. Demers and S. Shenker and 
                  L. Zhang}, 
  title =	 {{MACAW}: A media access protocol for wireless 
                  {LAN}s}, 
  crossref =	 {sigcomm94}, 
  pages =	 {212--225}, 
  annote =	 {RTS/CTS/DATA/Ack, MILD algorithm}, 
  url =		 {} 
} 
@InProceedings{BFC93, 
  author =	 {T. Ballardie and P. Fracis and J. Crowcroft}, 
  title =	 {An Architecture for Scalable Inter-Domain Multicast 
                  Routing}, 
  year =	 1993, 
  crossref =	 {sigcomm93}, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/proceedings/comm/166237/p85-ballardie/}} 
} 
@Article{FV97, 
  author =	 {D. Foster and R. Vohra}, 
  title =	 {Calibrated Learning and Correlated Equilibrium}, 
  journal =	 {Games and Economic Behavior}, 
  year =	 1997, 
  volume =	 21, 
  number =	 {1-2}, 
  pages =	 {40--55}, 
  url = 
                  {\url{http://ideas.repec.org/a/eee/gamebe/v21y1997i1-2p40-55.html}} 
} 
@InCollection{Bro51, 
  author =	 {G. Brown}, 
  title =	 {Iterative Solutions of Games by Fictitious Play}, 
  booktitle =	 {Activity Analysis of Production and Allocation}, 
  publisher =	 {Wiley, New York}, 
  year =	 1951 
} 
@Article{MR91, 
  author =	 {Paul Milgrom and John Roberts}, 
  title =	 {Adaptive and Sophisticated Learning in Normal Form 
                  Games}, 
  journal =	 {Games and Economic Behaviors}, 
  year =	 1991, 
  volume =	 3, 
  pages =	 {82--100} 
} 
@InProceedings{FSS04, 
  author =	 {Joan Feigenbaum and Rahul Sami and Scott Shenker}, 
  title =	 {Mechanism Design for Policy Routing}, 
  crossref =	 {podc04}, 
  url =		 {\url{http://cs-www.cs.yale.edu/homes/jf/FSS.pdf}}, 
  pages =	 {11--20} 
} 
@TechReport{FKMS04, 
  author =	 {Joan Feigenbaum and David Karger and Vahab Mirrokni 
                  and Rahul Sami}, 
  title =	 {Subjective-Cost Policy Routing}, 
  institution =	 {Yale University}, 
  year =	 2004, 
  number =	 {YALEU/DCS/TR-1302}, 
  month =	 Sep, 
  url =		 {\url{http://cs-www.cs.yale.edu/homes/jf/FKMS.pdf}} 
} 
@InProceedings{WXQY06, 
  author =	 {Hao Wang and Haiyong Xie and Lili Qiu and Yang 
                  Richard Yang and Yin Zhang and Albert Greenberg}, 
  title =	 {{COPE}: Traffic Engineering in Dynamic Networks}, 
  booktitle =	 {Proceedings of {ACM} {SIGCOMM}}, 
  year =	 2006, 
  address =	 {Pisa, Italy}, 
  month =	 Sep 
} 
@TechReport{WXYL05, 
  author =	 {Hao Wang and Haiyong Xie and Yang Richard Yang and Li Erran Li and Yanbin Liu and Avi Silberschatz}, 
  title =	 {On Stable Route Selection for Interdomain Traffic Engineering: Models, Analysis, and Guidelines}, 
  institution =	 {Yale University}, 
  year =	 2005, 
  number =	 {YALEU/DCS/TR-1316}, 
  month =	 Feb, 
  url =		 {\url{http://www-net.cs.yale.edu/publications/tr1316.pdf}} 
} 
@InProceedings{SA06, 
  author =	 {Srinivasan Seetharaman and Mostafa Ammar}, 
  title =	 {Characterizing and Mitigating Inter-domain Policy 
                  Violations in Overlay Routes}, 
  booktitle =	 {Proc. of {ICNP}}, 
  year =	 2006 
} 
@InProceedings{WXYL05in, 
  author =	 {Hao Wang and Haiyong Xie and Yang Richard Yang and Li Erran Li and Yanbin Liu and Avi Silberschatz}, 
  title =	 {On the Stability of Rational, Heterogeneous Interdomain Route Selection}, 
  crossref =	 {icnp05}, 
  year =	 2005 
} 
@InProceedings{ANB05, 
  author =	 {Sharad Agarwal and Antonio Nucci and Supratik Bhattacharyya}, 
  title =	 {Measuring the Shared Fate of {IGP} Engineering and Interdomain Traffic}, 
  crossref =	 {icnp05}, 
  year =	 2005 
} 
@InProceedings{ZGK+05, 
  author =	 {Chun Zhang and Zihui Ge and Jim Kurose and Yong Liu and Don Towsley}, 
  title =	 {Optimal Routing with Multiple Traffic Matrices: Tradeoff between Average Case and Worst Case Performance}, 
  crossref =	 {icnp05}, 
  year =	 2005 
} 
@InProceedings{ZLG+05, 
  author =	 {Chun Zhang and Yong Liu and Weibo Gong and Jim Kurose and Robbert Moll and Don Towsley}, 
  title =	 {On Optimal Routing with Multiple Traffic Matrices}, 
  crossref =	 {infocom05}, 
  year =	 2005 
} 
@TechReport{DWXY05, 
  author =	 {Ronny Dakdouk and Hao Wang and Haiyong Xie and Yang Richard Yang}, 
  title =	 {Interdomain Routing as Social Choice: A New Perspective}, 
  institution =	 {Yale University}, 
  year =	 2005, 
  number =	 {YALEU/DCS/TR-1331}, 
  month =	 Jul, 
  url =		 {\url{http://www-net.cs.yale.edu/publications/tr1331.pdf}} 
} 
@techreport{BFL96, 
  author =	 "Matt Blaze and Joan Feigenbaum and Jack Lacy", 
  title =	 "Decentralized Trust Management", 
  number =	 "96-17", 
  month =	 "28,", 
  year =	 1996, 
  url = 
                  {} 
} 
@InProceedings{BFL96, 
  author =	 {Matt Blaze and Joan Feigenbaum and Jack Lacy}, 
  title =	 {Decentralized trust management}, 
  booktitle =	 {IEEE Symposium on Security and Privacy}, 
  pages =	 {164--173}, 
  year =	 1996, 
  month =	 May, 
  annote =	 {We identify the trust management problem as a 
                  distinct and important component of security in 
                  network services. Aspects of the trust management 
                  problem include formulating security policies and 
                  security credentials, determining whether particular 
                  sets of credentials satisfy the relevant policies, 
                  and deferring trust to third parties. Existing 
                  systems that support security in networked 
                  applications, including X.509 and PGP, address only 
                  narrow subsets of the overall trust management 
                  problem and...}, 
  url = 
                  {} 
} 
@InProceedings{BFNO01, 
  author =	 {L. Barriere and P. Fraigniaud and L. Narajanan and 
                  J. Opatrny}, 
  title =	 {Robust Position Based Routing in Wireless Ad Hoc 
                  Networks with Unstable Transmission Ranges}, 
  booktitle =	 {Proceedings of 5th ACM Int. Workshop on Discrete 
                  Algorithms and Methods for Mobile Computing and 
                  Communications ({DIAL-M}'01)}, 
  pages =	 {19--27}, 
  year =	 2001, 
  url =		 {\url{http://path.berkeley.edu/dsrc/reading/barriere.pdf}} 
} 
@InProceedings{BFT99, 
  author =	 {Jean-Chrysostome Bolot and Sacha Fosse-Parisis and 
                  and Don Towsley}, 
  title =	 {Adaptive {FEC}-Based error control for interactive 
                  audio in the {I}nternet}, 
  crossref =	 "infocom99", 
  abstract =	 {Excessive packet loss rates can dramatically 
                  decrease the audio quality perceived by users of 
                  Internet telephony applications. Recent results 
                  suggest that error control schemes using forward 
                  error correction (FEC) are good candidates for 
                  decreasing the impact of packet loss on audio 
                  quality. With FEC schemes, redundant information is 
                  transmitted along with the original information so 
                  that the lost original data can be recovered at 
                  least in part from the redundant 
                  information. Clearly, sending additional redundancy 
                  increases the probability of recovering lost 
                  packets, but it also increases the bandwidth 
                  requirements and thus the loss rate of the audio 
                  stream. This means that the FEC scheme must be 
                  coupled to a rate control scheme. Furthermore, the 
                  amount of redundant information used} 
} 
@InProceedings{BG01, 
  author =	 {Lichun Bao and J. J. Garcia-Luna-Aceves}, 
  title =	 {A New Approach to Channel Access Scheduling for Ad 
                  Hoc Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {We study the problem of media access control in the 
                  novel regime of sensor networks, where unique 
                  application behavior and tight constraints in 
                  computation power, storage, energy resources, and 
                  radio technology have shaped this design space to be 
                  very different from that found in traditional mobile 
                  computing regime. Media access control in sensor 
                  networks must not only be energy efficient but 
                  should also allow fair bandwidth allocation to the 
                  infrastructure for all the nodes in a multihop 
                  network. We propose an adaptive rate control 
                  mechanism aiming to support these two goals and find 
                  that such a scheme is most effective in achieving 
                  our fairness goal while being energy efficient for 
                  both low and high duty cycle of network traffic.} 
} 
@Book{BG92, 
  author =	 {D. Bertsekas and R. Gallager}, 
  title =	 {Data Networks}, 
  publisher =	 {Prentice-Hall, Second Edition}, 
  year =	 {1992}, 
  abstract =	 {explain the maxmin fairness} 
} 
@InProceedings{BGMRSS00, 
  author =	 {Yuri Breitbart and Minos Garofalakis and Cliff 
                  Martin and Rajeev Rastogi and S. Seshadri and Avi 
                  Silberschatz}, 
  title =	 {Topology Discovery in Heterogeneous IP Networks}, 
  crossref =	 "infocom00", 
  annote = 
                  {\url{http://www.bell-labs.com/user/minos/Abstracts/infocom00-abs.html}} 
} 
@InProceedings{BGRZ03, 
  author =	 {Jacqueline Boyer and Fabrice Guillemin and Philippe 
                  Robert and Bert Zwart}, 
  title =	 {Heavy tailed {M/G/1}-{PS} queues with impatience and 
                  admission control in packet networks}, 
  crossref =	 {infocom03}, 
  year =	 2003, 
  url =		 {\url{http://www.ieee-infocom.org/2003/papers/05_03.PDF}} 
} 
@InProceedings{BGT02, 
  author =	 {T. Bu and L. Gao and D. Towsley}, 
  title =	 {On characterizing {BGP} routing table growth}, 
  booktitle =	 {Proceedings of {IEEE} Global {I}nternet Symposium}, 
  year =	 2002, 
  address =	 {Taipei, Taiwan}, 
  month =	 Nov 
} 
@InProceedings{BGW01, 
  author =	 {Nikita Borisov and Ian Goldberg and David Wagner}, 
  title =	 {Intercepting Mobile Communications: The Insecurity 
                  of 802.11}, 
  crossref =	 "mobicom01", 
  abstract =	 {The 802.11 standard for wireless networks includes a 
                  Wired Equivalent Privacy (WEP) protocol, used to 
                  protect link-layer communications from eavesdropping 
                  and other attacks. We have discovered several 
                  serious security flaws in the protocol, stemming 
                  from misapplication of cryptographic primitives. The 
                  flaws lead to a number of practical attacks that 
                  demonstrate that WEP fails to achieve its security 
                  goals. In this paper, we discuss in detail each of 
                  the flaws, the underlying security principle 
                  violations, and the ensuing attacks.} 
} 
@InProceedings{BH00:incentive, 
  author =	 {L. Buttyan and J. P. Hubaux}, 
  title =	 {Enforcing Service Availability in Mobile Ad-Hoc 
                  {WANs}}, 
  crossref =	 "mobihoc00", 
  year =	 2000, 
  url = 
                  {\url{http://icawww.epfl.ch/Publications/Buttyan/ButtyanH00.ps}}, 
  annote = {incentive} 
} 
@InProceedings{BH00:tcp, 
  author =	 {F. Baccelli and D. Hong}, 
  title =	 {{TCP} is Max-Plus Linear}, 
  crossref =	 {sigcomm00}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm2000/conf/paper/sigcomm2000-7-1.ps.gz}} 
} 
@InProceedings{BH01, 
  author =	 {L. Buttyan and J. P. Hubaux}, 
  title =	 {Rational Exchange -- A Formal Model Based on Game 
                  Theory}, 
  booktitle =	 {Proceedings of 2nd International Workshop on 
                  Electronic Commerce ({WELCOM} 2001)}, 
  year =	 2001, 
  address =	 {Heidelberg, Germany}, 
  month =	 Nov, 
  url = 
                  {\url{http://icawww.epfl.ch/Publications/Buttyan/ButtyanH01.ps}} 
} 
@Article{BH02, 
  author =	 {L. Buttyan and J. P. Hubaux}, 
  title =	 {Stimulating Cooperation in Self-Organizing Mobile Ad 
                  Hoc Networks}, 
  journal =	 {{ACM} Journal for Mobile Networks ({MONET}), special 
                  issue on Mobile Ad Hoc Networks}, 
  year =	 2002, 
  month =	 {summer}, 
  url = 
                  {\url{http://lcawww.epfl.ch/Publications/Buttyan/TR01\_046.ps}} 
} 
@inproceedings{BH03, 
  author =	 {Christian Bettstetter and Christian Hartmann}, 
  title =	 {Connectivity of Wireless Multihop Networks in a 
                  Shadow Fading Environment}, 
  booktitle =	 {Proceedings of the 6th International Workshop on 
                  Modeling Analysis and Simulation of Wireless and 
                  Mobile Systems}, 
  year =	 2003, 
  isbn =	 {1-58113-766-4}, 
  pages =	 {28--32}, 
  address =	 {San Diego, CA}, 
  doi =		 {\url{http://doi.acm.org/10.1145/940991.940998}}, 
  publisher =	 {ACM Press}, 
} 
@InProceedings{BRS03, 
  author =	 {Thomas Bressoud and Rajeev Rastogi and Mark Smith}, 
  title =	 {Optimal Configuration for {BGP} Route Selection}, 
  crossref =	 {infocom03}, 
  url = 
                  {\url{http://www.ieee-infocom.org/2003/papers/23_01.PDF}}, 
  annote =	 { Focus on how to choose egress link. Formulate it as 
                  a generalized assignment problem (GAP), and propose 
                  heuristics (approximation algorithms). [erran]: They 
                  have an interesting first step. However, their cost 
                  is intra-as path cost (IGP distances). We want to 
                  min real financial cost in payment to provider 
                  ISPs. They did not consider peering constraint (no 
                  internal capacity constraint as well). They only 
                  consider egress selection. They do not study the 
                  convergence when multiple ISPs interact. The 
                  convergence issue seems to be tricky. Their 
                  algorithms are not very interesting. It just uses 
                  GAP algorithm by Shmoys and Tardos and tries to 
                  correct capacity violation of peering links by a 
                  simple greedy method.} 
} 
@Book{BH69, 
  author =	 {Arthur Bryson and Yu-Chi Ho}, 
  title =	 {Applied Optimal Control: Optimization, Estimation, 
                  and Control}, 
  publisher =	 {Blaisdell Publishing Company}, 
  year =	 1969 
} 
@InProceedings{MBGR03, 
  author =	 {Z. Mao and R. Bush and T. Griffin and M. Roughan}, 
  title =	 {{BGP} Beacons}, 
  crossref =	 {imc03} 
} 
@Article{BHE00, 
  author =	 {N. Bulusu and J. Heidemann and D. Estrin}, 
  title =	 {{GPS-less} low-cost outdoor localization for very 
                  small devices}, 
  journal =	 {IEEE Personal Communications Magazine}, 
  year =	 2000, 
  volume =	 7, 
  number =	 5, 
  pages =	 {28--34}, 
  month =	 Oct, 
  abstract =	 {a grid of beacon nodes with known locations; each 
                  unknown node sets its position to the centroid of 
                  the locations of the beacons connected to the 
                  unknown. The position accuracy is about one-third of 
                  the separation distance between beacons, implying a 
                  high beacon density for practical 
                  purposes. Instrumenting the physical world through 
                  large networks of wireless sensor nodes, 
                  particularly for applications like environmental 
                  monitoring of water and soil, requires that these 
                  nodes be very small, light, untethered and 
                  unobtrusive. The problem of localization, i.e., 
                  determining where a given node is physically located 
                  in a network is a challenging one, and yet extremely 
                  crucial for many of these applications. Practical 
                  considerations such as the small size, form factor, 
                  cost and power constraints of nodes preclude the 
                  reliance on GPS (Global Positioning System) on all 
                  nodes in these networks. In this paper, we review 
                  localization techniques and evaluate the 
                  effectiveness of a very simple connectivity-metric 
                  method for localization in outdoor environments that 
                  makes use of the inherent radio-frequency (RF) 
                  communications capabilities of these devices. A 
                  fixed number of reference points in the network with 
                  overlapping regions of coverage transmit periodic 
                  beacon signals. Nodes use a simple connectivity 
                  metric, that is more robust to environmental 
                  vagaries, to infer proximity to a given subset of 
                  these reference points. Nodes localize themselves to 
                  the centroid of their proximate reference 
                  points. The accuracy of localization is then 
                  dependent on the separation distance between two 
                  adjacent reference points and the transmission range 
                  of these reference points. Initial experimental 
                  results show that the accuracy for 90\% of our data 
                  points is within one-third of the separation 
                  distance. However future work is needed to extend 
                  the technique to more cluttered environments.}, 
  url =		 {} 
} 
@inproceedings{BHE01, 
  author =	 "N. Bulusu and J. Heidemann and D. Estrin", 
  title =	 "Adaptive Beacon Placement", 
  booktitle =	 {Proceedings of the 21st International Conference on 
                  Distributed Computing Systems ({ICDCS}-21)}, 
  pages =	 "489--498", 
  address =	 {Phoenix, Arizona}, 
  year =	 2001, 
  month =	 Apr, 
  abstract =	 {Beacon placement strongly affects the quality of 
                  spatial localization, a critical service for 
                  context-aware applications in wireless sensor 
                  networks; yet this aspect of localization has 
                  received little attention. Fixed beacon placement 
                  approaches such as uniform and very dense placement 
                  are not always viable and will be inadequate in very 
                  noisy environments in which sensor networks may be 
                  expected to operate (with high terrain and 
                  propagation uncertainties). In this paper, we 
                  motivate the need...}, 
  url =		 {} 
} 
@article{BJ02, 
  author =	 {Alex Berg and Tibor Jordan}, 
  title =	 {A Proof of {C}onnelly's conjecture on 3-connected 
                  generic cycles}, 
  journal =	 {J. Comb. Theory B.}, 
  year =	 2002, 
  annote =	 {proves that every 3-connected minimal redundantly 
                  rigid graph can be obtained from K4 by a series of 
                  extensions}, 
  url =		 {\url{http://www.cs.elte.hu/egres/tr/egres-01-08.pdf}} 
} 
@Article{BK01, 
  author =	 {Robert T. Buche and Harold J. Kushner}, 
  title =	 {Rate of Convergence for Constrained Stochastic 
                  Approximation Algorithms}, 
  journal =	 {SIAM Journal on Control and Optimization}, 
  year =	 2001, 
  volume =	 40, 
  number =	 4, 
  pages =	 {1011--1041}, 
  url = 
                  {\url{http://www4.ncsu.edu:8030/\verb$~$rtbuche/papers/SA-Rate1.pdf}} 
} 
@InProceedings{BK02, 
  author =	 {A. Banerjee and S. Khuller}, 
  title =	 {A Clustering Scheme for Hierarchical Control in 
                  Multi-Hop Wireless Networks}, 
  crossref =	 {infocom02}, 
  year =	 2002 
} 
@InProceedings{BRS02, 
  author =	 {Thomas C. Bressoud and Rajeev Rastogi and Mark A. Smith}, 
  title =	 {Optimal Configuration for {BGP} Route Selection}, 
  crossref =	 {infocom02}, 
  year =	 2002 
} 
@Article{BK03, 
  author =	 {V. Borkar and P. R. Kumar}, 
  title =	 {Dynamic {Cesaro-Wardrop} Equilibration in Networks}, 
  journal =	 {IEEE Transactions on Automatic Control}, 
  year =	 2003, 
  volume =	 48, 
  number =	 3, 
  pages =	 {382--396}, 
  month =	 Mar, 
  annote =	 {We analyze a routing scheme for a broad class of 
                  networks which converges (in the Cesaro sense) with 
                  probability one to the set of approximate 
                  Cesaro-Wardrop equilibria, an extension of the 
                  notion of a Wardrop equilibrium. The network model 
                  allows for wireline networks where delays are caused 
                  by flows on links, as well as wireless networks, a 
                  primary motivation for us, where delays are caused 
                  by other flows in the vicinity of nodes. The routing 
                  algorithm is distributed, using only the local 
                  information about observed delays by the nodes, and 
                  is moreover impervious to clock offsets at 
                  nodes. The scheme is also fully asynchronous, since 
                  different iterates have their own counters and the 
                  orders of packets and their acknowledgments may be 
                  scrambled. Finally, the scheme is adaptive to the 
                  traffic patterns in the network. The demonstration of 
                  convergence in a fully dynamic context involves the 
                  treatment of two-time scale distributed asynchronous 
                  stochastic iterations. Using an ODE approach, the 
                  invariant measures are identified. Due to a 
                  randomization feature in the algorithm, a direct 
                  stochastic analysis shows that the algorithm avoids 
                  non-Wardrop equilibria. Finally, some comments on 
                  the existence, uniqueness, stability, and other 
                  properties of Wardrop equilibria are made.}, 
  url = 
                  {\url{http://black.csl.uiuc.edu/\verb$~$prkumar/ps_files/wardrop.pdf}} 
} 
@InProceedings{BK98:ecn, 
  author =	 {H. Balakrishnan and R. Katz}, 
  title =	 {Explicit Loss Notification and Wireless Web 
                  Performance}, 
  booktitle =	 {Proceedings of IEEE Globecom Internet 
                  Mini-Conference}, 
  year =	 1998 
} 
@Article{BK98:udg, 
  author =	 {Heinz Breu and David G. Kirkpatrick}, 
  title =	 {Unit disk graph recognition is {NP}-hard}, 
  journal =	 {Computational Geometry}, 
  year =	 1998, 
  volume =	 9, 
  number =	 {1-2}, 
  pages =	 {3--24}, 
  url =		 {\url{http://www.cs.ubc.ca/cgi-bin/tr/1993/TR-93-27.pdf}} 
} 
@article{BKL99, 
  author =	 {Bonnie Berger and Jon Kleinberg and Tom Leighton}, 
  title =	 {Reconstructing a three-dimensional model with 
                  arbitrary errors}, 
  journal =	 {Journal of the ACM (JACM)}, 
  volume =	 46, 
  number =	 2, 
  year =	 1999, 
  issn =	 {0004-5411}, 
  pages =	 {212--235}, 
  doi =		 {\url{http://doi.acm.org/10.1145/301970.301972}}, 
  publisher =	 {ACM Press}, 
} 
@InProceedings{BKMR98, 
  author =	 {John W. Byers and Michael Luby and Michael 
                  Mitzenmacher and and Ashu Rege}, 
  title =	 {A Digital Fountain Approach to Reliable Distribution 
                  of Bulk Data}, 
  crossref =	 "sigcomm98", 
  abstract =	 {use Tornado code} 
} 
@InProceedings{BKSS+00, 
  author =	 {Lee Breslau and Edward Knightly and Scott Shenker 
                  and Ion Stoica and Hui Zhang}, 
  title =	 {Endpoint Admission Control: Architectural Issues and 
                  Performance}, 
  crossref =	 "sigcomm00", 
  abstract =	 {measurement based} 
} 
@InProceedings{BKSSZ00, 
  author =	 {Lee Breslau and Edward W. Knightly and Scott Shenker 
                  and Ion Stoica and Hui Zhang}, 
  title =	 {Endpoint admission control: architectural issues and 
                  performance}, 
  crossref =	 "sigcomm00", 
  abstract =	 {The traditional approach to implementing admission 
                  control, as exemplified } 
} 
@InProceedings{BKTN98, 
  author =	 {Supratik Bhattacharyya and James F. Kurose and Don 
                  Towsley and Ramesh Nagarajan}, 
  title =	 {Efficient Rate-Controlled Bulk Data Transfer using 
                  Multiple Multicast Groups}, 
  crossref =	 "infocom98", 
  abstract =	 {multiple addresses} 
} 
@inproceedings{BL02, 
  title =	 {Nodes Bearing Grudges: Towards Routing Security, 
                  Fairness, and Robustness in Mobile Ad Hoc Networks}, 
  author =	 {Sonja Buchegger and Jean-Yves {Le Boudec}}, 
  booktitle =	 {10th Euromicro Workshop on Parallel, Distributed and 
                  Network-based Processing}, 
  year =	 2002 
} 
@inproceedings{BL02:confident, 
  author =	 {Sonja Buchegger and Jean-Yves {Le Boudec}}, 
  title =	 {Performance Analysis of the {CONFIDANT} Protocol: 
                  Cooperation Of Nodes - Fairness In Dynamic Ad-hoc 
                  NeTworks}, 
  crossref =	 "mobihoc02", 
  month =	 "June", 
  year =	 2002, 
  url = 
                  {\url{http://lcawww.epfl.ch/Publications/LeBoudec/BucheggerL02.pdf}} 
} 
@InProceedings{BL02:coop, 
  author =	 "S. Buchegger and J. Y. {Le Boudec}", 
  title =	 "Cooperative Routing in Mobile Ad-hoc Networks: 
                  Current Efforts Against Malice and Selfishness", 
  booktitle =	 "Proceedings of Mobile Internet Workshop. Informatik 
                  2002.", 
  address =	 "Dortmund, Germany", 
  year =	 2002, 
  month =	 Oct, 
  url = 
                  {\url{http://lcawww.epfl.ch/Publications/Buchegger/BucheggerL02C.pdf}} 
} 
@Book{vM64, 
  author =	 {John {von Neumann} and Oskar Morgenstern}, 
  title = 	 {Theory of Games and Economic Behavior}, 
  publisher = 	 {Princeton University Press}, 
  year = 	 1964, 
  edition =	 {3rd} 
} 
@InCollection{UB02, 
  author =	 {Steve Uhlig and Olivier Bonaventure}, 
  title =	 {Implications of interdomain traffic characteristics 
                  on traffic engineering}, 
  booktitle =	 {Special issue on traffic engineering of {E}uropean 
                  Transactions on Telecommunications}, 
  year =	 2002, 
  editor =	 {Jon Crowcroft and Anja Feldmann} 
} 
@InCollection{BL93, 
  author =	 {Justin A. Boyan and Michael L. Littman}, 
  editor =	 {Jack D. Cowan and Gerald Tesauro and and Joshua 
                  Alspector}, 
  title =	 {Packet routing in dynamically changing networks: A 
                  reinforcement learning approach}, 
  booktitle =	 {Advances in Neural Information Processing Systems}, 
  publisher =	 {Morgan Kaufmann}, 
  year =	 1993, 
  volume =	 6, 
  address =	 {San Francisco, CA}, 
  pages =	 {671--678}, 
  annote =	 {adaptive routing}, 
  url = 
                  {\url{http://www.cs.duke.edu/~mlittman/docs/routing-nips.ps}} 
} 
@Article{BM00, 
  author =	 {V. Borkar and S.P. Meyn}, 
  title =	 {The {O.D.E.} Method for Convergence of Stochastic 
                  Approximation and Reinforcement Learning}, 
  journal =	 {{SIAM} Journal on Control}, 
  year =	 2000, 
  volume =	 38, 
  number =	 2, 
  pages =	 {447--469}, 
  url = 
                  {\url{http://decision.csl.uiuc.edu/\verb$~$meyn/pages/ode.PS}} 
} 
@InProceedings{BM01, 
  author =	 {Thomas Bonald and Laurent Massoulie}, 
  title =	 {Impact of fairness on {I}nternet performance}, 
  crossref =	 {sigmetrics01}, 
  year =	 2001, 
  url =		 {\url{http://research.microsoft.com/Users/lmassoul/}} 
} 
@InProceedings{BMB00, 
  author =	 {T. Bonald and M. May and J-C. Bolot.}, 
  title =	 {Analytic Evaluation of {RED} Performance}, 
  crossref =	 "infocom00", 
  abstract =	 {}, 
  year =	 2000, 
  url =		 {} 
} 
@InProceedings{BMJH+98, 
  author =	 {J. Broch and D. A. Maltz and D. B. Johnson and Y. Hu 
                  and J. Jetcheva}, 
  title =	 {A performance comparison of multi-hop wireless ad 
                  hoc network routing protocols}, 
  crossref =	 {mobicom98}, 
  pages =	 {85--97}, 
  year =	 1998, 
  abstract =	 {}, 
  url =		 {} 
} 
@InProceedings{BMS96, 
  author =	 {C. Blundo and L. A. Frota Mattos and D. R. Stinson}, 
  title =	 {Trade-offs between communication and storage in 
                  uncondinationally secure schemes for broadcast 
                  encryption and interactive key distribution}, 
  booktitle =	 crypto96, 
  year =	 1996, 
  address =	 {Santa Barbara, CA} 
} 
@manual{BMS99, 
  author =	 {Balenson, David and McGrew, David and Sherman, Alan}, 
  title =	 {Key Management for Large Dynamic Groups: One-way 
                  Function Trees and Amortized Initialization, 
                  INTERNET-DRAFT}, 
  year =	 {1999}, 
  abstract =	 {This project is part of the DCCM project. DCCM goals 
                  is for security management for very large, dynamic 
                  multi-party applications. It needs to provide the 
                  capability to dynamically specify/negotiate security 
                  policies via cryptographic context. Groups have 
                  managers, members, and subgroups. The group 
                  operations include start/end session, 
                  member/subgroup join session, freeze/thaw access to 
                  session, leave session, evicted from session. The 
                  multi-party application phases are: First 
                  Application/group/session initialization, security 
                  policy is specify/negotiated in this first 
                  phase. Second, phase is Group member initialization 
                  using authenticate public key (X.509v3 certificate), 
                  secure DNS and establish pairwise keys using 
                  IKE. The third phase is group key establishment and 
                  re-key phase. Rekey can be SKDC, Group DH, LKH, or 
                  OFT. The last phase is group communication 
                  phase. The Confidentiality can be achieved by IPSec, 
                  TLS, or application layer. Authenticity can be 
                  achieved by MAC for group and signature for 
                  individual.} 
} 
@InProceedings{BMSU99, 
  author =	 {P. Bose and P. Morin and I. Stojmenovic and 
                  J. Urrutia}, 
  title =	 {Routing with Guaranteed Delivery in Ad Hoc Wireless 
                  Networks}, 
  booktitle =	 {Proceedings of 3rd ACM International Workshop on 
                  Discrete Algorithms and Methods for Mobile Computing 
                  and Communications ({DIAL-M}'99)}, 
  pages =	 {48--55}, 
  year =	 1999, 
  annote =	 {face-2; see GPSR} 
} 
@Book{BMW56, 
  author =	 {M. Beckmann and C. B. McGuire and C. B. Winsten}, 
  title =	 {Studies in the Economics of Transportation}, 
  publisher =	 {Yale University Press}, 
  year =	 1956 
} 
@InProceedings{BNS00, 
  author =	 {Amotz Bar-Noy and Joseph Naor and Baruch Schieber}, 
  title =	 {Pushing Dependent Data in Clients-Providers-Servers 
                  Systems}, 
  crossref =	 "mobicom00", 
  abstract =	 {In a satellite and wireless networks and in advanced 
                  traffic information systems in which the up-link 
                  bandwidth is very limited, a server broadcasts data 
                  files in a round-robin manner. The data files are 
                  provided by different providers and are accessed by 
                  many clients. The providers are independent and 
                  therefore files may share information. The clients 
                  who access these files may have different patterns 
                  of access. Some clients may wish to access more than 
                  one file at a time in any order, some clients may 
                  access one file out of of several files, and some 
                  clients may wish to access a second file only after 
                  accessing another file. The goal of the server is to 
                  order the files in a way that minimizes the access 
                  time of the clients given some a-priori knowledge of 
                  their access patterns. This paper introduces a 
                  clients-providers-servers model that better 
                  represents certain environments than the traditional 
                  clients-servers model. Then, we show that a random 
                  order of the data files performs well independent of 
                  the specific access pattern. Our main technical 
                  contribution is showing how to de-randomize the 
                  randomized algorithm that is based on selecting a 
                  random order. The resulting algorithm is a 
                  polynomial time deterministic algorithm that finds 
                  an order that achieves the bounds of the random 
                  order. } 
} 
@Article{BO00, 
  author =	 {Mario Baldi and Yoram Ofek}, 
  title =	 {End-to-end delay analysis of video-conferencing over 
                  packet-switched networks}, 
  journal =	 ton, 
  year =	 2000, 
  month =	 aug, 
  volume =	 8, 
  number =	 4 
} 
@InProceedings{BOP94, 
  title =	 {{TCP} {Vegas}: New Techniques for Congestion 
                  Detection and Avoidance}, 
  author =	 {L. Brakmo and S. O'Malley and L. Peterson}, 
  crossref =	 "sigcomm94", 
  abstract =	 {First vegas, notice the three interpretations} 
} 
@InProceedings{ACFK03, 
  author =	 {Y Azar and E Choen and A Fiat and H Kaplan and H 
                  Racke}, 
  title =	 {Optimal oblivious routing in polynomial time}, 
  crossref =	 {stoc03}, 
  year =	 2003 
} 
@InProceedings{Rac02, 
  author =	 {H Racke}, 
  title =	 {Minimizing congestion in general networks}, 
  crossref =	 {focs02}, 
  year =	 2002 
} 
@inproceedings{BP00, 
  author =	 "Paramvir Bahl and Venkata N. Padmanabhan", 
  title =	 "{RADAR}: An In-Building {RF}-Based User Location and 
                  Tracking System", 
  crossref =	 "infocom00", 
  pages =	 "775--784", 
  year =	 2000, 
  abstract =	 {The proliferation of mobile computing devices and 
                  local-area wireless networks has fostered a growing 
                  interest in location-aware systems and services. In 
                  this paper we present RADAR, a radio-frequency (RF) 
                  based system for locating and tracking users inside 
                  buildings. RADAR operates by recording and 
                  processing signal strength information at multiple 
                  base stations positioned to provide overlapping 
                  coverage in the area of interest. It combines 
                  empirical measurements with signal propagation... }, 
  annote =	 {use pattern matching by sampling signal patterns at 
                  different locations}, 
  url =		 {} 
} 
@Article{BP95, 
  author =	 {L. S. Brakmo and L. L. Peterson}, 
  title =	 {{TCP} {Vegas}: End to End Congestion Avoidance on a 
                  Global {I}nternet}, 
  journal =	 jsac, 
  year =	 1995, 
  volume =	 13, 
  number =	 8, 
  month =	 Oct, 
  annote =	 {Journal version of \ref{BOP94}.}, 
  url =		 {} 
} 
@Article{BPSK97, 
  author =	 {Hari Balakrishnan and Venkata N. Padmanabhan and 
                  Srinivasan Seshan and Randy H. Katz}, 
  title =	 {A comparison of mechanisms for improving {TCP} 
                  performance over wireless links}, 
  journal =	 ton, 
  year =	 1997, 
  volume =	 5, 
  number =	 6, 
  month =	 Dec, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p756-balakrishnan/}} 
} 
@InProceedings{BPSS+98, 
  author =	 {H. Balakrishnan and V. Padmanabhan and S. Seshan and 
                  M. Stemm and R. H. Katz}, 
  title =	 {{TCP} Behavior of a Busy {I}nternet Server: Analysis 
                  and Improvements}, 
  crossref =	 "infocom98", 
  year =	 1998, 
  url = 
                  {\url{http://www.sds.lcs.mit.edu/~hari/papers/infocom98.ps.gz}} 
} 
@Proceedings{ngi05, 
  title =	 {Proceedings of 1st Conference on Traffic Engineering 
                  For The Next Generation {I}nternet}, 
  year =	 2005, 
  address =	 {Rome, Italy}, 
  month =	 Apr 
} 
@InProceedings{DBEV05, 
  author =	 {Barth Dominique and Lelia Blin and Loubna Echabbi 
                  and Sandrine Vial}, 
  title =	 {Distributed cost management in a selfish 
                  multi-operator {BGP} network}, 
  crossref =	 {ngi05} 
} 
@InProceedings{QB05, 
  author =	 {Bruno Quoitin and Olivier Bonaventure}, 
  title =	 {A Cooperative Approach to Interdomain Traffic 
                  Engineering}, 
  crossref =	 {ngi05} 
} 
@manual{BR98, 
  author =	 {T. Bates and Y. Rekhter}, 
  title =	 {Scalable Support for Multi-homed Multi-provider 
                  Connectivity, {RFC} 2260}, 
  year =	 1998, 
  month =	 Jan, 
  abstract =	 {}, 
  url =		 {\url{http://www.faqs.org/rfcs/rfc2260.html}} 
} 
@Misc{BRITE, 
  key =	 {A. Medina and A. Lakhina and I. Matta and J. Byers}, 
  author =	 {A. Medina and A. Lakhina and I. Matta and J. Byers}, 
  title =	 {{BRITE}: {B}oston University Representative 
                  {I}nternet Topology Generator}, 
  howpublished = {Available from \url{http://www.cs.bu.edu/brite}} 
} 
@InProceedings{BS02, 
  author =	 {Ciprian Borcea and Ileana Streinu}, 
  title =	 {On the Number of Embeddings of Minimally Rigid 
                  Graphs}, 
  booktitle =	 {Proceedings of {ACM} Symposium on Computational 
                  Geometry ({SoCG})}, 
  year =	 2002, 
  address =	 {Barcelona, Spain}, 
  month =	 Jun, 
  url = 
                  {\url{http://cs.smith.edu/~streinu/Research/publications.html}} 
} 
@Article{BS03, 
  author =	 {A. R. Beresford and F. Stajano}, 
  title =	 {Location Privacy in Pervasive Computing}, 
  journal =	 {{IEEE} Pervasive Computing}, 
  year =	 2003, 
  volume =	 1, 
  pages =	 {46--55}, 
  annote =	 {location} 
} 
@Article{BS97, 
  author =	 {K. Brown and S. Singh}, 
  title =	 {{M-TCP}: {TCP} for Mobile Cellular Networks}, 
  journal =	 ccr, 
  year =	 1997, 
  volume =	 27, 
  number =	 5, 
  url = 
                  {ftp://ftp.ece.orst.edu:/pub/users/singh/papers/mtcp.ps.gz} 
} 
@InProceedings{BSAK95, 
  author =	 {H. Balakrishnan and S. Seshan and E. Amir and 
                  R. Katz}, 
  title =	 {Improving {TCP/IP} Performance over Wireless 
                  Networks}, 
  crossref =	 "mobicom95", 
  url =		 {\url{http://www.cs.berkeley.edu/~hari/papers/mcn.ps}} 
} 
@Article{BSK95, 
  author =	 {H. Balakrishnan and S. Seshan and R. H. Katz}, 
  title =	 {Improving Reliable Transport and Handoff Performance 
                  in Cellular Wireless Networks}, 
  journal =	 {ACM Wireless Networks}, 
  year =	 1995, 
  volume =	 1, 
  number =	 4, 
  month =	 Dec, 
  annote =	 {Modify network-layer software at the base station 
                  and mobile host, and preserve the end-to-end 
                  semantics of TCP.}, 
  url = 
                  {} 
} 
@InProceedings{BSP99, 
  author =	 {B. Nandy and N. Seddigh and P. Pieda.}, 
  title =	 {Diffserv's Assured Forwarding {PHB}: What Assurance 
                  does the Customer Have?}, 
  booktitle =	 {NOSSDAV '99}, 
  year =	 1999, 
  month =	 Jul 
} 
@InProceedings{BSR99, 
  author =	 {H. Balakrishnan and S. Seshan and H. Rahul}, 
  title =	 {An Integrated Congestion Management Architecture for 
                  {I}nternet Hosts}, 
  crossref =	 "sigcomm99", 
  http =	 {}, 
  abstract =	 {} 
} 
@InProceedings{BT01, 
  author =	 {Tian Bu and Don Towsley}, 
  title =	 {Fixed Point Approximations for {TCP} Behavior in an 
                  {AQM} Network}, 
  crossref =	 "sigmetrics01", 
  abstract =	 {}, 
  url = 
                  {\url{http://www.cs.umd.edu/conference/sigmetrics2001/abstracts/bu.html}} 
} 
@InProceedings{BT94, 
  author =	 {J. Bolot and T. Turletti}, 
  title =	 {A Rate Control Mechanism for Packet Video in the 
                  {I}nternet}, 
  crossref =	 "infocom94", 
  abstract =	 {RAP} 
} 
@Book{BT96, 
  author =	 {D. Bertsekas and J. N. Tsitsiklis}, 
  title =	 {Neuro-dynamic Programming}, 
  publisher =	 {Athena Scientific}, 
  year =	 1996 
} 
@Book{BT97, 
  author =	 {D. Bertsekas and J. N. Tsitsiklis}, 
  title =	 {Parallel and Distributed Computation: Numerical 
                  Methods}, 
  publisher =	 {Athena Scientific}, 
  year =	 1997 
} 
@InProceedings{BTJ99, 
  author =	 {Supratik Bhattacharyya and Don Towsley and Jim 
                  Kurose}, 
  title =	 {The Loss Path Multiplicity Problem in Multicast 
                  Congestion Control}, 
  crossref =	 "infocom99", 
  abstract =	 {talk about the LPM problem.} 
} 
@InProceedings{BTW94, 
  author =	 {J. Bolot and T. Turletti and I. Wakeman}, 
  title =	 {Scalable Feedback Control for Multicast Video 
                  Distribution in the {I}nternet}, 
  crossref =	 "sigcomm94", 
  abstract =	 {}, 
  url =		 {} 
} 
@Misc{BV97, 
  key =		 {S. Berson and S. Vincent}, 
  title =	 {Aggregation of {I}nternet integrated service state}, 
  author =	 {S. Berson and S. Vincent}, 
  year =	 1997, 
  howpublished = {(IETF Internet-Draft), 
                  draft-berson-classy-approach-01.txt}, 
  abstract =	 {Using aggregation to reduce flow states} 
} 
@InProceedings{BWK00, 
  author =	 {B. Bensaou and Y. Wang and C. C. Ko}, 
  title =	 {Fair medium access in 802.11 based wireless ad-hoc 
                  networks}, 
  crossref =	 {mobihoc00}, 
  year =	 2000, 
  abstract =	 {Estimation-based fair MAC. Attempt to equalize 
                  throughput/weight for all nodes. Two parts of the 
                  algorithm: 1) fair share estimation (by overhearing 
                  RTS/CTS/DATA; 2) window adjustment (define 
                  Ti=Wi/weight_of_i , 
                  To=Wo/weight_of_all_neighbor. Fairness index = 
                  Ti/To. If too large, cw*=2; if too small, cw/=2.}, 
  url =		 {} 
} 
@InProceedings{BY04, 
  author =	 {Pratik Biswas and Yinyu Ye}, 
  title =	 {Semidefinite Programming for Ad Hoc Wireless Sensor 
                  Network Localization}, 
  crossref =	 {ipsn04}, 
  year =	 2004 
} 
@InProceedings{BZ96, 
  author =	 {J. C.R. Bennett and H. Zhang}, 
  title =	 {Hierarchical Packet Fair Queueing Algorithms}, 
  crossref =	 "sigcomm96", 
  year =	 1996, 
  url = 
                  {\url{http://redriver.cmcl.cs.cmu.edu/~hzhang-ftp/TON-97-Oct.pdf}} 
} 
@Article{BZ97, 
  author =	 {J. C.R. Bennett and H. Zhang}, 
  title =	 {Hierarchical Packet Fair Queueing Algorithms}, 
  journal =	 ton, 
  year =	 1997, 
  volume =	 5, 
  number =	 5, 
  pages =	 {675--689}, 
  month =	 Oct, 
  annote =	 {Journal version of \ref{BZ96}.}, 
  url = 
                  {\url{http://redriver.cmcl.cs.cmu.edu/~hzhang-ftp/TON-97-Oct.pdf}} 
} 
@Misc{Bai98, 
  key =		 {J. Bailey}, 
  author =	 {J. Bailey}, 
  title =	 {Internet Price Discrimination: Self-Regulation, 
                  Public Policy, and Global Electronic Commerce}, 
  howpublished = {\url{http://www.tprc.org/abstracts98/bailey.pdf}}, 
  annote =	 {location; locate friends using cell phone} 
} 
@unpublished{Bai98:rmtp, 
  author =	 {Whetten, Brian}, 
  title =	 {RMTP-II Security Consideration}, 
  note =	 {SMuG talk}, 
  year =	 {1998}, 
  month =	 dec, 
  abstract =	 {RMTP-II protocol entities can be divided into 
                  several roles. Sender (SN), Top node (TN), 
                  Designated receiver (DR), and receiver (RN). By this 
                  talk, they assume DR, and TN are trusted.The talk 
                  then went on about security concern for each type of 
                  attacks. First is DOS attack. It can be DOS to a 
                  specific receiver. It will result in corruption of 
                  control state. It can also overload the network by 
                  spurious retransmission request, or sender 
                  transmitting too fast, or improperly scoped 
                  multicast packet. It can also exhaust CPU by 
                  flooding group membership changes. It can also 
                  exhaust memory by refusal to ACK packets. The 
                  suggestion for the DOS prevention proposed are: 
                  extends IPSec to provide light weight group 
                  authentication by giving different keys depending on 
                  roles, and also maybe for different trust 
                  domains. For example one key for all DR and TN in 
                  the same trust domain, one key for each sender, one 
                  key for all receivers. However it still allows valid 
                  senders and receivers access to DoS attacks, if they 
                  are malicious. Also it still allow brute force DoS 
                  attacks. The brute force attack can only be solved 
                  at the IP Level. Also the talk propose some weak 
                  defenses for DoS. For example, check IP address of 
                  Control Packet against Local Group List can help 
                  corruption of Control State, prevent Spurious 
                  ReTrans, and membership change flooding. It can also 
                  limit bandwidth on Local Retransmission to prevent 
                  spurious retransmission request. It can also remove 
                  slow receivers to help refusal to ACK packets, and 
                  spurious retransmission request. Anther defense is 
                  to use IP multicast defenses such sa pruning. This 
                  can deal with the problem of improperly scoped 
                  packet, or faster senders } 
} 
@manual{Bal96, 
  author =	 {A. Ballardie}, 
  title =	 {Scalable Multicast Key Distribution, {RFC} 1949}, 
  year =	 {1996}, 
  month =	 May, 
  abstract =	 {Using CBT router to distribute keys}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1949.htm}} 
} 
@Article{Bel89, 
  author =	 {S. Bellovin}, 
  title =	 {ecurity Problems in the {TCP/IP} Protocol Suite}, 
  journal =	 ccr, 
  year =	 1989, 
  volume =	 19, 
  number =	 2, 
  month =	 Apr, 
  url = 
                  {\url{http://www.cs.berkeley.edu/~istoica/cs268/papers/bellovin89.ps}} 
} 
@inproceedings{Ber91, 
  author =	 {Shimshon Berkovits}, 
  title =	 {How to Broadcast a Secret}, 
  pages =	 {535--541}, 
  booktitle =	 eurocrypt91, 
  year =	 1991, 
  abstract =	 {lock} 
} 
@Book{Ber99, 
  author =	 {D. Bertsekas}, 
  title =	 {Nonlinear Programming}, 
  publisher =	 {Athena Scientific}, 
  year =	 1999, 
  edition =      {2nd Edition} 
} 
@Proceedings{BlockIsland03, 
  title =	 {Block Island Workshop on Cooperative Control}, 
  year =	 {2003}, 
  series =	 {Lecture Notes in Control and Information Sciences}, 
  publisher =	 {Springer Verlag}, 
  address =	 {Block Island, RI}, 
  note =	 {To appear.} 
} 
@Book{Bol85, 
  author =	 {Bela Bollob\'{a}s}, 
  title =	 {Random Graph Theory}, 
  publisher =	 {Academic Press}, 
  year =	 1985, 
  address =	 {London}, 
} 
@InProceedings{Bol93, 
  author =	 {Jean-Chrysostome Bolot}, 
  title =	 {End-to-End Packet Delay and Loss Behavior in the 
                  {I}nternet}, 
  crossref =	 "sigcomm93", 
  abstract =	 {notice spikes in packet delays}, 
  url =		 {} 
} 
@Techreport{Bon98, 
  author =	 {Thomas Bonald}, 
  title =	 {Comparison of {TCP} {R}eno and {TCP} {V}egas via 
                  Fluid Approximation}, 
  number =	 {RR-3563}, 
  institution =	 {INRIA, France}, 
  year =	 1998, 
  url =		 {} 
} 
@Article{Bor02, 
  author =	 {V. Borkar}, 
  title =	 {Reinforcement Learning In Markovian Evolutionary 
                  Games}, 
  journal =	 {Advances in Complex Systems}, 
  year =	 2002, 
  volume =	 5, 
  number =	 1, 
  pages =	 {55--72}, 
  url =		 {} 
} 
@Article{Bor97, 
  author =	 {V. Borkar}, 
  title =	 {Stochastic Approximation With Two Time Scales}, 
  journal =	 {Systems and Control Letter}, 
  year =	 1997, 
  volume =	 29, 
  pages =	 {291--294}, 
  url =		 {} 
} 
@Article{Bra68, 
  author =	 {D. Braess}, 
  title =	 {Uber Ein Paradoxon Der Verkehrsplanung}, 
  journal =	 {Unternehmensforschung}, 
  year =	 1968, 
  number =	 12, 
  pages =	 {258--268}, 
  annote =	 {Available from 
                  \url{http://homepage.ruhr-uni-bochum.de/Dietrich.Braess/}} 
} 
@Article{Bra86, 
  author =	 {A. Brandt}, 
  title =	 {The stochastic equation {$Y_{n+1} = A_n Y_n + B_n$} 
                  with stationary coefficients}, 
  journal =	 {Adv. Appl. Prob.}, 
  year =	 1986, 
  volume =	 18, 
  pages =	 {211--220}, 
  abstract =	 {Has a stationary solution} 
} 
@Manual{Bro97, 
  title =	 {Notes on FEC supported Congestion Control for One to 
                  Many Reliable Multicast, Working Draft}, 
  author =	 {F. Brockners}, 
  abstract =	 {} 
} 
@InProceedings{TDRR05, 
  author =	 {Renata Teixeira and Nick Duffield and Jennifer 
                  Rexford and Matt Roughan}, 
  title =	 {Traffic matrix reloaded: Impact of routing changes}, 
  booktitle =	 {Proceedings of Passive and Active Measurement}, 
  year =	 2005, 
  month =	 Mar 
} 
@PhdThesis{Bul02, 
  author =	 {Nirupama Bulusu}, 
  title =	 {Self-Configuring Localization Systems }, 
  school =	 {UCLA}, 
  year =	 2002, 
  annote =	 {adaptive beacon location}, 
  url =		 {} 
} 
@Article{CA96, 
  author =	 {S. Y. Cheung and M. H. Ammar}, 
  title =	 {Using Destination Set Grouping to Improve 
                  Performance of Window-Controlled Multipoint 
                  Connections}, 
  journal =	 {Computer Communications}, 
  year =	 1996, 
  pages =	 {723--736}, 
  abstract =	 {Formalized DSG for window-controlled scheme} 
} 
@InProceedings{CABR03, 
  author =	 {Douglas De Couto and Daniel Aguayo and John Bicket 
                  and Robert Morris}, 
  title =	 {A High-Throughput Path Metric for Multi-Hop Wireless 
                  Routing}, 
  crossref =	 {mobicom03}, 
  year =	 2003 
} 
@TechReport{CSK03, 
  author =	 {M. Caesar and L. Subramanian and R. H. Katz}, 
  title =	 {Route Cause Analysis of {I}nternet Routing Dynamics}, 
  institution =	 {UC Berkeley}, 
  year =	 2003, 
  number =	 {UCB/CSD-04-1302}, 
  month =	 2003 
} 
@Misc{RouteViews, 
  key =		 {{R}outeViews project}, 
  author =	 {{R}outeViews project}, 
  howpublished = {\url{http://www.routeviews.org/}} 
} 
@Misc{CAIDA, 
  key =		 {CAIDA Cooporative Association for {I}nternet Data 
                  analysis.}, 
  author =	 {{CAIDA} Cooporative Association for {I}nternet Data 
                  analysis.}, 
  howpublished = {\url{http://www.caida.org/tools/}} 
} 
@InProceedings{CAL96, 
  author =	 {Shun Yan Cheung and Mostafa H. Ammar and Xue Li}, 
  title =	 {On the Use of Destination Set Grouping to Improve 
                  fairness in Multicast Video Distribution}, 
  crossref =	 "infocom96", 
  abstract =	 {Have both Inter-stream and inter-stream 
                  protocol. For the intra-stream, receivers estimate 
                  state at UNLOAD, LOADED, CONGESTED state. Then Poll 
                  message is used to check the get a count of number 
                  of receivers in each state. As for inter-stream 
                  protocol, the major problem is to avoid erroneous 
                  group movement. A receiver join a low group, report 
                  CONGESTED to slow down the group, and then find no 
                  use, and return to lower group. The approaches are: 
                  1) By invitation only. The source will control 
                  invitation point. } 
} 
@article{CC89, 
  author =	 {Guang-Huei Chiou and Wen-Tsuen Chen}, 
  title =	 {Secure Broadcasting Using the Secure Lock}, 
  journal =	 tose, 
  pages =	 {929--934}, 
  volume =	 15, 
  number =	 8, 
  month =	 aug, 
  year =	 1989 
} 
@Article{CCJ90, 
  author =	 {B. N. Clark and C. J. Colbourn and D. S. Johnson}, 
  title =	 {Unit Disk Graphs}, 
  journal =	 {Discrete Mathematics}, 
  year =	 1990, 
  volume =	 86, 
  pages =	 {165--177}, 
  url =		 {\url{http://www.mai.liu.se/~svlin/Journals.html}} 
} 
@InProceedings{CCKM01, 
  author =	 {P. Castro and P. Chiu and T. Kremenek and R. Muntz}, 
  title =	 {A probabilistic room location service for wireless 
                  networked environments}, 
  booktitle =	 {Proceedings of Ubicomp}, 
  year =	 2001 
} 
@Article{CCLNY03, 
  author =	 {R. Castro and M. Coates and G. Liang and R. Nowak 
                  and B. Yu }, 
  title =	 {Internet Tomography: Recent Developments}, 
  journal =	 {Statistical Science}, 
  year =	 2003, 
  annote =	 {Today's Internet is a massive, distributed network 
                  which continues to explode in size as ecommerce and 
                  related activities grow. The heterogeneous and 
                  largely unregulated structure of the Internet 
                  renders tasks such as dynamic routing, optimized 
                  service provision, service level veri.cation, and 
                  detection of anomalous/malicious behavior extremely 
                  challenging. The problem is compounded by the fact 
                  that one cannot rely on the cooperation of 
                  individual servers and routers to aid in the 
                  collection of network traffic measurements vital for 
                  these tasks. In many ways, network monitoring and 
                  inference problems bear a strong resemblance to 
                  other inverse problems in which key aspects of a 
                  system are not directly observable. Familiar signal 
                  processing or statistical problems such as 
                  tomographic image reconstruction and phylogenetic 
                  tree identi.cation have interesting connections to 
                  those arising in networking. This article introduces 
                  network tomography, a new field which we believe will 
                  benefit greatly from the wealth of statistical theory 
                  and algorithms. It focuses especially on recent 
                  developments in the field including the application 
                  of pseudolikelihood methods and tree estimation 
                  formulations.}, 
  url =		 {\url{http://stat-www.berkeley.edu/~binyu/ps/cny.pdf}} 
} 
 
 
%http://www.nytimes.com/aponline/technology/AP-Comcast-Data-Discrimination.html?_r=1&oref=slogin&pagewanted=all 
@Misc{comcast07, 
  key =		 {New York Times}, 
  author =	 {{New York Times}}, 
  title =	 {Comcast Blocks Some {I}nternet Traffic}, 
  howpublished = {New York Times, Oct. 19}, 
  year =	 2007 
} 
@TechReport{CCLS02, 
  author =	 {Jin Cao and William S. Cleveland and Dong Lin and 
                  Don X. Sun}, 
  title =	 {The Effect of Statistical Multiplexing on the Long 
                  Range Dependence of Internet Packet Traffic}, 
  institution =	 {Bell Labs}, 
  year =	 2002, 
  note =	 {As the number of active connections (NAC) on an 
                  Internet link increases, the long-range dependence 
                  of packet traffic changes due to increased 
                  statistical multiplexing of packets from different 
                  connections. Four packet traffic variables are 
                  studied as time series --- inter-arrival times, 
                  sizes, packet counts in 100 ms intervals, and byte 
                  counts in 100 ms intervals. Results are based on the 
                  following: (1) the mathematical theory of marked 
                  point processes; (2) empirical study of 2526 packet 
                  traces, 5 min or 90 sec in duration, from 6 Internet 
                  monitors measuring 15 interfaces ranging from 100 
                  mbps to 622 mbps; (3) simple statistical models for 
                  the traffic variables; and (4) network simulation 
                  with NS. All variables have components of long-range 
                  dependence at all levels of the NAC. But the 
                  variances of the long-range dependent components of 
                  the sizes and of the inter-arrivals decrease to zero 
                  as the NAC increases; the sizes tend toward 
                  independent, and the inter-arrivals tend toward 
                  independent or very short range dependent. These 
                  changes in the sizes and inter-arrivals are not 
                  arrested by the increased upstream queueing that 
                  eventually occurs as the NAC increases. The 
                  long-range dependence of the count variables does 
                  not change with the NAC, but their standard 
                  deviations relative to the means decrease like one 
                  over the square root of the NAC, making the counts 
                  smooth relative to the mean. Theory suggests that 
                  once the NAC is large enough, increased upstream 
                  queueing should alter these properties of the 
                  counts, but in the empirical study and in the 
                  simulation study the NAC was not large enough to 
                  observe an alteration for 100 ms counts. The change 
                  in the long-range dependence of the sizes and 
                  inter-arrivals does not contradict the constancy of 
                  the long-range dependence of the counts because the 
                  summation operations that produce counts from the 
                  arrivals and sizes act on an increasing number of 
                  packets as the NAC increases. }, 
  url =		 {\url{http://cm.bell-labs.com/stat/doc/multiplex.pdf}} 
} 
@manual{CCPR+98, 
  author =	 {Canetti, R. and Cheng, P-C. and Pendarakis, D. and 
                  Rao, J.R. and Rohatgi, P. and Saha, D.}, 
  title =	 {An Architecture for Secure {I}nternet Multicast, 
                  INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 dec, 
  abstract =	 {Host architecture design based on IPSec. Therefore 
                  claim satisfy the requirements in taxonomy: 
                  flexibility in crypto and key management, 
                  independent of routing/reliability protocol, resue 
                  existing component, and suitable for main multicast 
                  application: 1m, fewm, mm. }, 
} 
@article{CD92, 
  author =	 {Stephen Casner and Stephen Deering}, 
  title =	 {First {IETF} {I}nternet Audiocast}, 
  journal =	 ccr, 
  volume =	 22, 
  number =	 3, 
  month =	 jul, 
  year =	 1992 
} 
@misc{CD97, 
  key =		 "G. Di Caro and M. Dorigo", 
  author =	 "G. Di Caro and M. Dorigo", 
  title =	 "AntNet: a mobile agents approach to adaptive 
                  routing", 
  text =	 "G. Di Caro and M. Dorigo, AntNet: a mobile agents 
                  approach to adaptive routing, 
                  Tech. Rep. IRIDIA/97-12, Universit Libre de 
                  Bruxelles, Belgium#", 
  url =		 {} 
} 
@InProceedings{CD99, 
  author =	 {R. Castaneda and S. R. Das}, 
  title =	 {Query localization techniques for on-demand routing 
                  protocols in ad hoc networks}, 
  crossref =	 {mobicom99}, 
  pages =	 {186--194}, 
  year =	 1999 
} 
@InProceedings{CDFGR98, 
  author =	 {R. Caceres and F. Douglis and A. Feldmann and 
                  G. Glass and M. Rabinovich}, 
  title =	 {Web proxy caching: the devil is in the details}, 
  booktitle =	 {Workshop on Internet Server Performance held with 
                  {SIGMETRICS} '98}, 
  url = 
                  {\url{http://www.cs.wisc.edu/~cao/WISP98/final-versions/anja.ps}}, 
  year =	 1998 
} 
@InProceedings{CDMF00, 
  author =	 {Keith Cheverst and Nigel Davies and Keith Mitchell 
                  and Adrian Friday}, 
  title =	 {Experiences of Developing and Deploying a 
                  Context-Aware Tourist Guide: The {GUIDE} Project}, 
  crossref =	 "mobicom00", 
  abstract =	 {The GUIDE system has been developed to provide city 
                  visitors with a hand-held context-aware tourist 
                  guide. The system has been successfully deployed in 
                  a major tourist destination and is currently at the 
                  stage where it is publicly available to visitors who 
                  wish to explore the city. Reaching this stage has 
                  been the culmination of a number of distinct 
                  research efforts. In more detail, the development of 
                  GUIDE has involved: capturing a real set of 
                  application requirements, investigating the 
                  properties of a cell-based wireless communications 
                  technology in a built-up environment and deploying a 
                  network based on this technology around the city, 
                  designing an information model to represent 
                  attractions and key buildings within the city and 
                  then populating this model, prototyping the 
                  development of a distributed application running 
                  across portable GUIDE units and stationary 
                  cell-servers, and, finally, evaluating the entire 
                  system during an extensive field-trial study. This 
                  paper reports on our results in each of these 
                  areas. We believe that through our work on the GUIDE 
                  project we have produced a blueprint for the 
                  development of interactive context-aware systems 
                  that should be of real value to those in the 
                  community who wish to develop such systems in a real 
                  environment.} 
} 
@InProceedings{CEKPS99, 
  author =	 {Isabella Chang and Robert Engel and Dilip Kandlur 
                  and Dimitrios Pendarakis and Debanjan Saha}, 
  title =	 {Key management for secure {I}nternet multicast using 
                  boolean function minimization techniques}, 
  crossref =	 "infocom99", 
  abstract =	 {Boolean function minimization}, 
  url =		 {} 
} 
@Article{CF98, 
  author =	 {D. Clark and W. Feng}, 
  title =	 {Explicit Allocation of Best-Effort Packet Delivery 
                  Service}, 
  journal =	 ton, 
  year =	 1998, 
  volume =	 6, 
  number =	 4, 
  pages =	 {362--373}, 
  month =	 Aug, 
  abstract =	 {}, 
  url = 
                  {\url{http://diffserv.lcs.mit.edu/Papers/exp-alloc-ddc-wf.ps}} 
} 
@InProceedings{CGMP01, 
  author =	 {Paul Castro and Benjamin Greenstein and Richard 
                  Muntz and Maria Papadopouli}, 
  title =	 {Locating Application Data Across Service Discovery 
                  Domains}, 
  crossref =	 "mobicom01", 
  abstract =	 {The bulk of proposed pervasive computing devices 
                  such as PDAs and cellular telephones operate as thin 
                  clients within a larger infrastructure. To access 
                  services within their local environment, these 
                  devices participate in a service discovery protocol 
                  which involves a master directory that registers all 
                  services available in the local environment. These 
                  directories typically are isolated from each 
                  other. Devices that move across service discovery 
                  domains have no access to information outside their 
                  current local domain. In this paper we propose an 
                  application-level protocol called VIA that enables 
                  data sharing among discovery domains. Each directory 
                  maintains a table of active links to other 
                  directories that share related information. A set of 
                  linked directories forms a data cluster that can be 
                  queried by devices for information. The data cluster 
                  is distributed, self-organizing, responsive to data 
                  mobility, and robust to failures. Using 
                  application-defined data schemas, clusters organize 
                  themselves into a hierarchy for efficient querying 
                  and network resource usage. Through analysis and 
                  simulation we describe the behavior of VIA under 
                  different workloads and show that the protocol 
                  overhead for both maintaining a cluster and handling 
                  failures grows slowly with the number of gateways. * 
                  THIS IS A STUDENT PAPER *} 
} 
@InProceedings{AC03, 
  author =	 {David Applegate and Edith Cohen}, 
  title =	 {Making Intra-Domain Routing Robust to Changing and 
                  Uncertain Traffic Demands: Understanding Fundamental 
                  Tradeoffs}, 
  crossref =	 {sigcomm03}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm2003/papers/p313-applegate.pdf}}, 
  year =	 2003, 
  annote =	 {1. considers minimizing maximum link utilization; 
                  2. admits that deals only with point-to-point 
                  demands, not point to multiple points such as 
                  interas multiple exit points (section 3.4).} 
} 
@InProceedings{ABC04, 
  author =	 {David Applegate and Lee Breslau and Edith Cohen}, 
  title =	 {Coping with Network Failures: Routing Strategies for Optimal Demand Oblivious Restoration}, 
  crossref =	 {sigmetrics04}, 
  year =	 2004, 
} 
@InProceedings{BBCM03, 
  author =	 {Nikhil Bansal and Avrim Blum and Shuchi Chawla and Adam Meyerson}, 
  title =	 {Online Oblivious Routing}, 
  booktitle =	 {Proceedings of {ACM} Symposium in Parallelism in Algorithms and Architectures ({SPAA})}, 
  year =	 2003 
} 
@InProceedings{CGSD04, 
  author =	 {Krishna Chintalapudi and Ramesh Govindan and Gaurav 
                  Sukhatme and Amit Dhariwal}, 
  title =	 {Ad-Hoc Localization Using Ranging and Sectoring}, 
  crossref =	 "infocom04" 
} 
@Book{CH88, 
  author =	 {G.M. Crippen and T.F. Havel}, 
  title =	 {Distance Geometry and Molecular Conformation}, 
  publisher =	 {John Wiley \& Sons}, 
  year =	 1988, 
  annote =	 {A survey of distance geometry} 
} 
@InProceedings{CHB03, 
  author =	 {S. Capkun and J. Hubaux and L. Buttyan}, 
  title =	 {Mobility Helps Security in Ad Hoc Networks}, 
  crossref =	 {mobihoc2003}, 
  year =	 2003, 
  month =	 Jun, 
  url =		 {}, 
} 
@inproceedings{CHH01, 
  author =	 "Srdan Capkun and Maher Hamdi and Jean-Pierre Hubaux", 
  title =	 "{GPS}-Free Positioning in Mobile ad-hoc Networks", 
  booktitle =	 "{HICSS}", 
  year =	 2001, 
  url =		 {} 
} 
@TechReport{CHKW98, 
  author =	 {Chiu, D. and Hurst, S. and Kadansky, M. and Wesley, 
                  J.}, 
  title =	 {{TRAM}: A Tree-based Reliable Multicast Protocol}, 
  institution =	 {Sun Microsystems Laboratory Technical Report Series}, 
  year =	 {1998}, 
  number =	 {TR-98-66.}, 
  abstract =	 {Dynamic to find DR nodes using expand ring search} 
} 
@Article{CHNY02, 
  author =	 {Mark Coates and Alfred Hero and Robert Nowak and Bin 
                  Yu}, 
  title =	 {Internet Tomography}, 
  journal =	 {Signal Processing Magazine}, 
  year =	 2002, 
  volume =	 19, 
  number =	 3, 
  pages =	 {47--65}, 
  month =	 May, 
  abstract =	 {}, 
  url =		 {\url{http://stat-www.berkeley.edu/~binyu/ps/spmag.ps}} 
} 
@Article{CJ89, 
  author =	 {Dah-Ming Chiu and Raj Jain}, 
  title =	 {Analysis of the Increase and Decrease Algorithms for 
                  Congestion Avoidance in Computer Networks}, 
  journal =	 {Computer Networks and ISDN Systems}, 
  year =	 {1989}, 
  month =	 Jun, 
  volume =	 {17}, 
  page =	 {1-14}, 
  abstract =	 {Propose the Additive Increase and Multiplicative 
                  Decrease algorithm.}, 
  url = 
                  {\url{http://www.cis.ohio-state.edu/~jain/papers/cong_av.htm}} 
} 
@inproceedings{CJBM01, 
  author =	 "Benjie Chen and Kyle Jamieson and Hari Balakrishnan 
                  and Robert Morris", 
  title =	 "Span: An energy-efficient coordination algorithm for 
                  topology maintenance in Ad Hoc wireless networks", 
  crossref =	 {mobicom01}, 
  pages =	 "85--96", 
  year =	 2001, 
  abstract =	 {This paper presents Span, a power saving technique 
                  for multi-hop ad hoc wireless networks that reduces 
                  energy consumption without significantly diminishing 
                  the capacity or connectivity of the network. Span 
                  builds on the observation that when a region of a 
                  shared-channel wireless network has a sufficient 
                  density of nodes, only a small number of them need 
                  be on at any time to forward traffic for active 
                  connections. Span is a distributed, randomized 
                  algorithm where nodes make local decisions on... }, 
  url =		 {} 
} 
@InProceedings{CJOS00, 
  author =	 {Mikkel Christiansen and Kevin Jeffay and David Ott 
                  and F. Donelson Smith}, 
  title =	 {Tuning {RED} for Web Traffic}, 
  crossref =	 "sigcomm00", 
  abstract =	 {We study the effects of RED on the performance of 
                  Web browsing.} 
} 
@Article{CK74, 
  author =	 {V. Cerf and R. Kahn}, 
  title =	 {A Protocol for Packet Network Interconnection}, 
  journal =	 toc, 
  month =	 May, 
  year =	 1974, 
  pages =	 {637--648}, 
  abstract =	 {Review the design of IP and TCP.}, 
  url = 
                  {\url{http://www.worldcom.com/about_the_company/cerfs_up/technical_writings/protocol_paper/}} 
} 
@Article{CKK01, 
  author =	 {C. Cetinkaya and V. Kanodia and E.W. Knightly}, 
  title =	 {Scalable services via egress admission control}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909595.pdf?isNumber=19626}} 
} 
@InProceedings{CKPWZ00, 
  author =	 { Dah Ming Chiu and Miriam Kadansky and Joe Provino 
                  and Joseph Wesley and Haifeng Zhu } , 
  title =	 {{P}runing algorithms for multicast flow control} , 
  booktitle =	 {Proceedings of the 2nd International Workshop on 
                  Networked Group Communication} , 
  year =	 2000 , 
  month =	 nov 
} 
@Article{CLJ02, 
  author =	 {Anthony Chen and Der-Horng Lee and R. Javakrishnan}, 
  title =	 {Computational study of state-of-the-art path-based 
                  traffic assignment algorithms}, 
  journal =	 {Mathematics and Computers in Simulation}, 
  year =	 2002, 
  number =	 59, 
  pages =	 {509--518} 
} 
@InProceedings{CLMP00, 
  author =	 {Tracy Camp and John Lusth and Jeff Matocha and 
                  Charles Perkins}, 
  title =	 {Reduced Cell Switching in a Mobile Computing 
                  Environment}, 
  crossref =	 "mobicom00", 
  abstract =	 {With the large number of laptop and palmtop computer 
                  purchases, a rapid growth of mobile usage in the 
                  Internet is expected. As mobile nodes move in a 
                  wireless computer network, a mobile node must 
                  determine when to switch its link-level point of 
                  attachment to the wired network. In this paper, we 
                  present six cell switching techniques and discuss 
                  their attributes. We then investigate the 
                  performance of the six techniques to discover the 
                  best method a mobile node should use to determine 
                  when to switch its link-level point of attachment to 
                  the wired network. } 
} 
@InProceedings{CLZ87, 
  author =	 {D. D. Clark and M. L. Lambert and L. Zhang}, 
  title =	 {{NETBLT}: a high throughput transport protocol}, 
  crossref =	 "sigcomm87", 
  url = 
                  {\url{http://www.acm.org/pubs/citations/proceedings/comm/55482/p353-clark/}}, 
  annote =	 {Specifies a rate-based, receiver-driven congestion 
                  control protocol.} 
} 
@InProceedings{CMB00, 
  author =	 {Yatin Chawathe and Steven McCanne and Eric 
                  A. Brewer}, 
  title =	 {{RMX}: Reliable Multicast for Heterogeneous 
                  Networks}, 
  crossref =	 "infocom00", 
  abstract =	 {Application layer multicast. Combination of TCP and 
                  multicast}, 
  url =		 {\url{http://www.cs.berkeley.edu/~yatin/papers/#top}} 
} 
@InProceedings{CMG96, 
  author =	 {Cavendish, D. and Mascolo, S. and Gerla}, 
  title =	 {Rate based congestion control for multicast {ABR} 
                  traffic}, 
  booktitle =	 "globecom96", 
  year =	 1996 
} 
@InProceedings{CMKB02, 
  author =	 {Jorge Cortes and Sonia Martinez and Timur Karatas 
                  and Francesco Bullo }, 
  title =	 {Coverage control for mobile sensing networks: 
                  variations on a theme}, 
  booktitle =	 {Mediterranean Conference on Control and Automation}, 
  year =	 2002, 
  address =	 {Lisbon, Portugal}, 
  month =	 {July 9-13}, 
  abstract =	 {This paper presents control and coordination 
                  algorithms for networks of autonomous vehicles. We 
                  focus on groups of vehicles performing distributed 
                  sensing tasks where each vehicle plays the role of a 
                  mobile tunable sensor. We design distributed 
                  gradient descent algorithms for a class of utility 
                  functions which encodes optimal coverage and sensing 
                  policies. These utility functions are studied in 
                  geographical optimization, vector quantization, and 
                  sensor allocation contexts. The algorithms exploit 
                  the computational geometry of spatial structures 
                  such as Voronoi diagrams. }, 
  url = 
                  {\url{http://motion.csl.uiuc.edu/~bullo/papers/2002b-cmkb.html}} 
} 
@InProceedings{CMN99, 
  author =	 {Ran Canetti and Tal Malkin and Kobbi Nissim}, 
  title =	 {Efficient Communication-Storage Tradeoffs for 
                  Multicast Encryption}, 
  booktitle =	 eurocrypt99, 
  year =	 1999 
} 
@Article{CMWM01, 
  author =	 {P.A. Chou and A.E. Mohr and A. Wang and S. Mehrotra}, 
  title =	 {Error control for receiver-driven layered multicast 
                  of audio and video}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909598.pdf?isNumber=19626}} 
} 
@Article{CN98, 
  author =	 "S. Chen and K. Nahrstedt", 
  title =	 "An overview of quality-of-service routing for the 
                  next generation high-speed networks: Problems and 
                  solutions", 
  journal =	 "IEEE Network Magazine, Special Issue on Transmission 
                  and Distribution of Digital Video", 
  year =	 1998, 
  url =		 {} 
} 
@Article{CO98, 
  author =	 {Jon Crowcroft and Philippe Oechslin}, 
  title =	 {Differentiated End-to-End {I}nternet Services using 
                  a Weighted Proportional Fair Sharing {TCP}}, 
  Journal =	 ccr, 
  Year =	 1998, 
  volume =	 28, 
  number =	 3, 
  month =	 Jul, 
  abstract =	 {Implement Kelly's proportional fairness.}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/ccr/archive/1998/jul98/ccr-9807-crowcroft.html}} 
} 
@manual{CP00, 
  author =	 {Canetti, R. and Pinkas, B.}, 
  title =	 {A taxonomy of multicast security issues (updated 
                  version), INTERNET-DRAFT}, 
  year =	 {2000}, 
  month =	 nov, 
  abstract =	 {\em{Multicast group characteristics}: group size, 
                  member chara. (computeing power, etc), member 
                  dynamics, expected life time, number and types of 
                  senders (known id. or not), volume and type of 
                  traffic. \em{Multicast security requirements}: 
                  Access Control (two types of access control, one by 
                  modifying IP Multicast, e.g. IGMP authentication) 
                  Authentication (Src, group), Secrecy (emphey, long 
                  term), Anonymous (from outsider, from group member), 
                  Availability. \em{Performance Parameter}: setup 
                  time, member enrollment/revocation overhead, time to 
                  authenticate and encrypt (sender), time to 
                  verification and decrypt(receiver), length of 
                  keys. \em{Scenario 1}: single senders with strong 
                  machines, many recipients (100K - 1M+) with weak 
                  machines, dynamic, bursty membership, weak ephemeral 
                  secrecy needed, strong authenticity needed, examples 
                  include pay per view movie, net cast and stock 
                  quotes. Considered by ISPs as the most important in 
                  IP multicast meeting/Workshop \em{Scenario 2} medium 
                  small groups (100s - 1K), many senders (unknown in 
                  advance), slowly changing membership, strong secrecy 
                  (sometimes), strong authenticity, may not need to 
                  know who is talking, examples include games, video 
                  conferences, lectures, classes, town hall meetings, 
                  distributed simulations } 
} 
@Article{CPB93, 
  author =	 {K. Claffy and G. Polyzos and H-W. Braun}, 
  title =	 {Measurement Considerations for Assessing 
                  Unidirectional Latencies}, 
  journal =	 {Internetworking: Research and Experience}, 
  year =	 1993, 
  volume =	 4, 
  number =	 3, 
  pages =	 {121--132}, 
  month =	 Sep, 
  note =	 {Claffy and colleagues found one-way delays measured 
                  along four Internet paths exhibited clear level 
                  shifts and non-constancies over the course of a 
                  day.}, 
  url =		 {} 
} 
@InProceedings{CPK99, 
  author =	 {Sang-Hun Chun and Hyun-Suk Park and Kyung-Sup Kwak}, 
  title =	 {An efficient congestion control algorithm for 
                  multicast {ABR} service in {ATM} network}, 
  booktitle =	 {TENCON}, 
  year =	 1999 
} 
@InProceedings{CPS94, 
  author =	 {Chris Charnes and Josef Pieprzyk and Rei 
                  Safavi-Naini}, 
  title =	 {Conditionally Secure Secret Sharing Schemes with 
                  Disenrollment Capability}, 
  booktitle =	 {2nd ACM Conference on Computer and Communications 
                  Security}, 
  year =	 1994, 
  pages =	 {89--95} 
} 
@InProceedings{CPW98, 
  author =	 {Shanwei Cen and Calton Pu and Jonathan Walpole}, 
  title =	 {Flow and Congestion Control for {I}nternet streaming 
                  applications}, 
  booktitle =	 {Proceedings of Multimedia Computing and Networking 
                  1998}, 
  year =	 1998, 
  month =	 Jan, 
  abstract =	 {AIMD} 
} 
@InProceedings{CRL96, 
  author =	 {A. Charny and K. K. Ramakrishnan and T. Lauck}, 
  title =	 {Scalability Issues for Distributed Explicit Rate 
                  Allocation in {ATM} Networks}, 
  crossref =	 "infocom96", 
  year =	 1996, 
  annote =	 {Describe the congestion control mechanisms for ATM 
                  networks. Present criteria for the selection between 
                  rate-based and credit-based approach.}, 
  url = 
                  {\url{http://www.research.att.com/~kkrama/papers/inf96_2-kkrama.ps}} 
} 
@InProceedings{CRZ00, 
  author =	 {Y. Chu and S. G. Rao and H. Zhang}, 
  title =	 {A Case For End System Multicast}, 
  crossref =	 {sigmetrics00}, 
  year =	 2000, 
  abstract =	 {Application Layer multicast}, 
  url = 
                  {\url{http://www.cs.cmu.edu/~sanjay/EndSystem/endsystem.html}} 
} 
@InProceedings{CSA00, 
  author =	 {Neal Cardwell and Stefan Savage and and Tom 
                  Anderson}, 
  title =	 {Modeling {TCP} Latency}, 
  crossref =	 "infocom00", 
  abstract =	 {}, 
  url = 
                  {\url{http://www.cs.washington.edu/homes/cardwell/papers/infocom2000tcp.pdf}} 
} 
@InProceedings{CSWH00, 
  author =	 {I. Clarke and O. Sandberg and B. Wiley and 
                  T. W. Hong}, 
  title =	 {Freenet: A Distributed Anonymous Information Storage 
                  and Retrieval System}, 
  booktitle =	 {{ICSI} Workshop on Design Issues in Anonymity and 
                  Unobservability}, 
  url =		 {\url{http://freenet.sourceforge.net/icsi.ps.gz}}, 
  year =	 2000, 
  month =	 Jul 
} 
@InProceedings{CSZ92, 
  author =	 {David D. Clark and Scott Shenker and Lixia Zhang}, 
  title =	 {Supporting real-time applications in an {I}ntegrated 
                  {S}ervices {P}acket {N}etwork: architecture and 
                  mechanism}, 
  crossref =	 "sigcomm92", 
  url =		 {}, 
  abstract =	 {Propose the IntServ architecture. IntServ, see 
                  \cite{BV97}, and \cite{PHS00} to see how to extend 
                  scalability.} 
} 
@InProceedings{CT00, 
  author =	 {J. Chang and L. Tassiulas}, 
  title =	 {Energy Conserving Routing in Wireless Ad Hoc 
                  Networks}, 
  crossref =	 {infocom00}, 
  pages =	 {22--31}, 
  url =		 {} 
} 
@InProceedings{CT90, 
  author =	 {Clark, D. and Tennenhouse, D.}, 
  title =	 {Architectural Considerations of a New Generation of 
                  Protocols}, 
  crossref =	 "sigcomm90", 
  abstract =	 {This paper proposes Application Level Framing (ALF) 
                  to solve the ``one size fits all'' protocol design 
                  problem. It explicitly includes an application's 
                  semantics in the design of that application's 
                  protocol. ALF says the best way to meet diverse 
                  application requirements is to leave as much 
                  functionality and flexibility as possible to the 
                  application. } 
} 
@Misc{CW97, 
  key =		 {D. Clark and J. Wroclawski}, 
  title =	 {An approach to service allocation in the {I}nternet}, 
  author =	 {D. Clark and J. Wroclawski}, 
  year =	 1997, 
  month =	 Jul, 
  howpublished = {(IETF Internet-Draft)}, 
  abstract =	 {Diffserv} 
} 
@InProceedings{MCYK06, 
  author =	 {Zheng Ma and Jiang Chen and Yang Richard Yang and 
                  Arvind Krishnamurthy.}, 
  title =	 {Optimal Capacity Sharing of Network with Multiple 
                  Overlays}, 
  booktitle =	 {Proceedings of the 14th IEEE International Workshop 
                  on Quality of Service ({IWQOS})}, 
  year =	 2006, 
  address =	 {New Haven, USA}, 
  month =	 {June}, 
  abstract =	 {Overlay networks have emerged as a generic 
                  networking paradigm to improve network performance 
                  and construct new applications. Although many 
                  overlay algorithms have been proposed lately, they 
                  tend to focus on a single overlay, without 
                  considering how to share network capacity with other 
                  traffic and other overlays. In this paper, we study 
                  optimal capacity sharing of network with multiple 
                  overlays. We first formulate the problem of optimal 
                  capacity sharing of overlays in the Internet using 
                  nolinear optimization theory. Then we show the 
                  sub-optimal sharing results between multiple 
                  overlays. Finally, we design efficient and 
                  distributed algorithms to solve the problem, and 
                  demonstrate the effectiveness of our design.} 
} 
@InProceedings{CWZ00, 
  author =	 {Zhiruo Cao and Zheng Wang and Ellen Zegura}, 
  title =	 {Rainbow Fair Queueing: Fair Bandwidth Sharing 
                  Without Per-Flow State}, 
  crossref =	 "infocom00", 
  abstract =	 {gatech} 
} 
@InProceedings{CWZ01, 
  author =	 {Zhiruo Cao and Zheng Wang and Ellen Zegura}, 
  title =	 {Performance of Hashing-Based Schemes for Internet 
                  Load Balancing}, 
  crossref =	 "infocom01", 
  abstract =	 {gatech} 
} 
@Article{CYEW+03, 
  author =	 {J.C. Chen and L. Yip and J. Elson and H. Wang and 
                  D. Maniezzo and R.E. Hudson and K. Yao and and 
                  D. Estrin}, 
  title =	 {Coherent Acoustic Array Processing and Localization 
                  on Wireless Sensor Networks}, 
  journal =	 {Proceedings of the {IEEE}}, 
  year =	 2003, 
  volume =	 91, 
  number =	 8, 
  month =	 Aug 
} 
@InProceedings{CYL03, 
  author =	 {Srijan Chakraborty and David K. Y. Yau and John 
                  C. S. Lui}, 
  title =	 {On the Effectiveness of Movement Prediction To 
                  Reduce Energy Consumption in Wireless Communication 
                  (extended abstract)}, 
  crossref =	 {sigmetrics03} 
} 
@InProceedings{Cao00, 
  author =	 {Guohong Cao}, 
  title =	 {A Scalable Low-Latency Cache Invalidation Strategy 
                  for Mobile Environments }, 
  crossref =	 "mobicom00", 
  abstract =	 {Caching frequently accessed data items on the client 
                  side is an effective technique to improve 
                  performance in a mobile environment. Classical cache 
                  invalidation strategies are not suitable for mobile 
                  environments due to the disconnection and mobility 
                  of the mobile clients. One attractive cache 
                  invalidation technique is based on invalidation 
                  reports (IRs). However, the IR-based cache 
                  invalidation solution has two major drawbacks, which 
                  have not been addressed in previous research. First, 
                  there is a long query latency associated with this 
                  solution since a client cannot answer the query 
                  until the next IR interval. Second, when the server 
                  updates a hot data item, all clients have to query 
                  the server and get the data from the server 
                  separately, which wastes a large amount of 
                  bandwidth. In this paper, we propose an IR-based 
                  cache invalidation algorithm which can significantly 
                  reduce the query latency and efficiently utilize the 
                  broadcast bandwidth. Detailed simulation experiments 
                  are carried out to evaluate the proposed 
                  methodology. Compared to previous IR-based schemes, 
                  our scheme can significantly improve the throughput 
                  and reduce the query latency, the number of uplink 
                  request, and the broadcast bandwidth requirements. } 
} 
@Manual{Car96, 
  title =	 {Architectural Principles of the Internet {RFC} 1958}, 
  author =	 {B. Carpenter}, 
  month =	 Jun, 
  year =	 1996, 
  abstract =	 {The Internet and its architecture have grown in 
                  evolutionary fashion from modest beginnings, rather 
                  than from a Grand Plan. While this process of 
                  evolution is one of the main reasons for the 
                  technology's success, it nevertheless seems useful 
                  to record a snapshot of the current principles of 
                  the Internet architecture. This is intended for 
                  general guidance and general interest, and is in no 
                  way intended to be a formal or invariant reference 
                  model.}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1958.html}} 
} 
@Article{Cha82, 
  author =	 {David Chaum}, 
  title =	 {Untraceable electronic mail, return addresses, and 
                  digital pseudonyms}, 
  journal =	 {Communications of the {ACM}}, 
  year =	 1982, 
  volume =	 4, 
  number =	 2, 
  month =	 Feb, 
  annote =	 {mix} 
} 
@MastersThesis{Cha94, 
  author =	 {Anna Charny}, 
  title =	 {An Algorithm for Rate Allocation in a 
                  Packet-Switching Network With Feedback}, 
  school =	 {MIT}, 
  year =	 1994, 
  abstract =	 {Distributed calculation of maxmin.} 
} 
 
@Misc{CiscoMultiHoming, 
  key =	 {{Cisco Inc.}}, 
  author =	 {{Cisco Inc.}}, 
  title =	 {Sample Configurations for Load Sharing with {BGP} in 
                  Single and Multihomed Environments}, 
  month =	 {}, 
  howpublished = {available at \url{http://www.cisco.com/warp/public/459/40.html}} 
} 
@Misc{CiudadSim02, 
  key =		 {CiudadSim}, 
  title =	 {CiudadSim}, 
  howpublished = {Available at: 
                  \url{http://www-rocq.inria.fr/scilab/CiudadSim/}} 
} 
@Unpublished{Cla00, 
  title =	 {Rethinking the Design of the {I}nternet: end to end 
                  arguments vs. the brave new world}, 
  author =	 {D. Clark}, 
  note =	 {Presented at TPRC 2000, Alexandria, VA}, 
  month =	 Sep, 
  year =	 2000, 
  crossref =	 "Cla88", 
  abstract =	 {See \cite{Cla88} for the original design. Over the 
                  last few years, a number of new requirements have 
                  emerged for the Internet and its applications. To 
                  certain stakeholders, these various new requirements 
                  might best be met through the addition of new 
                  mechanism in the core of the network. 1) Making the 
                  network more trustworthy, while the end-points 
                  cannot be trusted, seems to imply more mechanism in 
                  the center of the network to enforce good 
                  behavior. }, 
  url = 
                  {\url{http://itel.mit.edu:/itel/docs/jun00/TPRC-Clark-Blumenthal.pdf}} 
} 
@Article{Cla71, 
  author =	 {E. Clarke}, 
  title =	 {Multipart Pricing of Public Goods}, 
  journal =	 {Public Choice}, 
  year =	 1971, 
  volume =	 11, 
  pages =	 {17--33} 
} 
@InProceedings{Cla88, 
  author =	 {D. Clark}, 
  title =	 {Design Philosophy of the {DARPA} Internet Protocols}, 
  crossref =	 "sigcomm88", 
  year =	 1988, 
  abstract =	 {Review the design philosophy of Internet. See 
                  \cite{Cla00} for current issues.}, 
  url =		 {} 
} 
@InProceedings{Coh77, 
  author =	 {D. Cohen}, 
  title =	 {Issues in {Transnet} Packetized Voice Communication}, 
  booktitle =	 {Fifth Data Communications Symposium}, 
  pages =	 {6.10--6.13}, 
  year =	 1977, 
  address =	 {Snowbird, UT}, 
  month =	 sep 
} 
@Misc{Col98, 
  key =		 {Andy Collins}, 
  author =	 {Andy Collins}, 
  title =	 {The {D}etour Framework for Packet Rerouting}, 
  howpublished = {{PhD} Qualifying Examination}, 
  month =	 Nov, 
  year =	 1998, 
  abstract =	 {Detour framework}, 
  url = 
                  {\url{http://www.cs.washington.edu/research/networking/detour/}} 
} 
@Unpublished{Con03, 
  author =	 {Robert Connelly}, 
  title =	 {Generic Global Rigidity}, 
  annote =	 {Available at: 
                  \url{http://www.math.cornell.edu/~connelly/global.pdf}}, 
  year =	 2003, 
  url =		 {\url{http://www.math.cornell.edu/~connelly/global.pdf}} 
} 
@Article{Cruz95, 
  author =	 {R. L. Cruz}, 
  title =	 {Quality of Service Guarantees in Virtual Circuit 
                  Switched Networks}, 
  journal =	 jsac, 
  year =	 1995, 
  month =	 Aug, 
  url = 
                  {\url{http://www-ece.ucsd.edu/~cruz/papers/Cruz.JSAC.95.pdf}} 
} 
@Misc{Crypto++, 
  title =	 {Crypto++4.0}, 
  author =	 {Wei Dai}, 
  howpublished = {Available at 
                  \url{http://www.eskimo.com/~weidai/cryptlib.html}}, 
} 
@TechReport{DA97, 
  author =	 {Tim Dierks and Christopher Allen}, 
  title =	 {The TLS Protocol Version 1.0}, 
  institution =	 {IETF Transport Layer Security ({TLS}) Working Group}, 
  type =	 {Work in progress}, 
  month =	 nov, 
  year =	 1997 
} 
@TechReport{DBFK+97, 
  author =	 {Brian DeCleene and Supratik Bhattacharaya and Timur 
                  Friedman and Mark Keaton and Jim Kurose and Dan 
                  Rubenstein and Don Towsley}, 
  title =	 {Reliable Multicast Framework ({RMF}): A White Paper}, 
  institution =	 {UMass}, 
  year =	 1998 
} 
@article{DC90, 
  author =	 {S.E. Deering and D.R. Cheriton}, 
  title =	 {Multicast Routing in Datagram Internetworks and 
                  Extended {LANs}}, 
  journal =	 tocs, 
  pages =	 {85--110}, 
  volume =	 8, 
  number =	 2, 
  month =	 May, 
  year =	 1990 
} 
@article{DDC97, 
  author =	 {Diot, C. and Dabbous, W. and Crowcroft, J.}, 
  title =	 {Multipoint communication: A survey of protocols, 
                  functions and mechanism}, 
  journal =	 jsac, 
  year =	 {1997}, 
  volume =	 {15}, 
  number =	 {3}, 
  pages =	 {277--290}, 
  abstract =	 {another RM survey} 
} 
@InProceedings{DEFJ+94, 
  author =	 {S. Deering and D. Estrin and D. Farinacci and 
                  V. Jacobson and C.-G. Liu and L. Wei}, 
  title =	 {An Architecture for Wide-Area Multicast Routing}, 
  year =	 1994, 
  crossref =	 {sigcomm94}, 
  url = 
                  {ftp://catarina.usc.edu/pub/estrin/docs/PIM.Sigcomm94.ps.Z} 
} 
@TechReport{DES93, 
  author =	 {National Institute of Standards and Technology}, 
  title =	 {Data Encryption Standard}, 
  institution =	 {U.S. Department of Commerce}, 
  type =	 {NIST FIPS}, 
  number =	 {PUB 46-2}, 
  month =	 dec, 
  year =	 1993 
} 
@InProceedings{DGR99, 
  author =	 {N. Duffield and M. Grossglauser and 
                  K. K. Ramakrishnan}, 
  title =	 {Distrust and Privacy: Axioms for Multicast 
                  Congestion Control}, 
  crossref =	 "nossdav99", 
  abstract =	 {No detail} 
} 
@manual{DH95, 
  author =	 {S. Deering and R. Hinden}, 
  title =	 {{I}nternet Protocol, Version 6 ({IPv6}) 
                  Specification, {RFC} 1883}, 
  month =	 dec, 
  year =	 1995 
} 
@InProceedings{DH98, 
  author =	 {J. Deng and Z. Haas}, 
  title =	 {Dual Busy Tone Multiple Access ({DBTMA}): A New 
                  Medium Access Control for Packet Radio Networks}, 
  booktitle =	 {IEEE {ICUPC}'98}, 
  address =	 {Florence, Italy}, 
  month =	 Oct, 
  year =	 1998, 
  abstract =	 {Improve over RTS/CTS by adopting BTMA due to 
                  mobility.}, 
  url =		 {} 
} 
@InProceedings{DKS89, 
  author =	 {A. Demers and S. Keshav and S. Shenker}, 
  title =	 {Analysis and Simulation of a Fair Queueing 
                  Algorithm}, 
  crossref =	 "sigcomm89", 
  abstract =	 {Evaluate WFQ}, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/proceedings/comm/75246/p1-demers/}} 
} 
@InProceedings{DL03, 
  author =	 {Nick Duffield and Carsten Lund}, 
  title =	 {Predicting Resource Usage and Estimation Accuracy in 
                  an {IP} Flow Measurement Collection Infrastructure}, 
  crossref =	 {imc03}, 
  year =	 2003, 
  url = 
                  {\url{http://www.icir.org/vern/imc-2003/papers/p313-duffield-lund.pdf}}, 
  abstract =	 {This paper describes a measurement infrastructure 
                  used to collect detailed IP traffic measurements 
                  from an IP backbone. Usage, i.e, bytes transmitted, 
                  is determined from raw NetFlow records generated by 
                  the backbone routers. The amount of raw data is 
                  immense. Two types of data sampling in order to 
                  manage data volumes: (i) (packet) sampled NetFlow in 
                  the routers; (ii) sizedependent sampling of NetFlow 
                  records. Furthermore, dropping of NetFlow records in 
                  transmission can be regarded as an uncontrolled form 
                  of sampling. We show how to manage the trade-off 
                  between estimation accuracy and data 
                  volume. Firstly, we describe the sampling error that 
                  arises from all three types of sampling when 
                  estimating usage per traffic class: how it can be 
                  predicted from models and raw data, and how it can 
                  be estimated directly from the sampled data 
                  itself. Secondly, we show how to determined the 
                  usage of resources, computational cycle, 
                  storage within the components of the 
                  infrastructure. These two sets of methods allow 
                  dimensioning of the measurement infrastructure in 
                  order to meet accuracy goals for usage estimation.} 
} 
@TechReport{DLRS01, 
  author =	 {Bridget Dahill and Brian Neil Levine and Elizabeth 
                  Royer and Clay Shields}, 
  title =	 {A Secure Routing Protocol for Ad Hoc Networks}, 
  institution =	 {UMass}, 
  year =	 2001, 
  url = 
                  {ftp://ftp.cs.umass.edu/pub/techrept/techreport/2001/UM-CS-2001-037.ps} 
} 
@InProceedings{DLT01, 
  author =	 {Nick Duffield and Carsten Lund and Mikkel Thorup}, 
  title =	 {Charging from Sampled Network Usage}, 
  crossref =	 {imc01}, 
  year =	 2001, 
  url = 
                  {\url{http://www.icir.org/vern/imw-2001/imw2001-papers/03.pdf}}, 
  abstract =	 {IP flows have heavy-tailed packet and byte size 
                  distributions. This make them poor candidates for 
                  uniform sampling, i.e. selecting in flows since 
                  omission or inclusion of a large flow can have a 
                  large effect on estimated total traffic. Flows 
                  selected in this manner are thus unsuitable for use 
                  in usage sensitive billing. We propose instead using 
                  a size-dependent sampling scheme which gives 
                  priority to the larger contributions to customer 
                  usage. This turns the heavy tails to our advantage; 
                  we can obtain accurate estimates of customer usage 
                  from a relatively small number of important 
                  samples. The sampling scheme allows us to control 
                  error when charging is sensitive to estimated usage 
                  only above a given base level. A refinement allows 
                  us to strictly limit the chance that a customers 
                  estimated usage will exceed their actual 
                  usage. Furthermore, we show that a secondary goal, 
                  that of controlling the rate at which samples are 
                  produced, can be fulfilled provided the billing 
                  cycle is sufficiently long. All these claims are 
                  supported by experiments on flow traces gathered 
                  from a commercial network.} 
} 
@Article{DM97, 
  author =	 "C. Dougligeris and R. Mazumdar", 
  title =	 "A Game-Theoretic Approach to Flow Control in an 
                  Integrated Environment", 
  booktitle =	 "Journal of the Franklin Institute", 
  volume =	 329, 
  number =	 3, 
  pages =	 "383--402", 
  month =	 Mar, 
  year =	 1992, 
} 
@InProceedings{DO97, 
  author =	 {Dante DeLucia and Katia Obraczka}, 
  title =	 {Multicast Feedback Suppression Using 
                  Representatives}, 
  crossref =	 "infocom97", 
  abstract =	 {use representative} 
} 
@InProceedings{DP98, 
  author =	 {Dan Decasper and Bernhard Platter}, 
  title =	 {{DAN}: Distributed Code Caching for Active Networks}, 
  crossref =	 {infocom98}, 
  url =		 {} 
} 
@InProceedings{DPG01, 
  author =	 {L. Doherty and K. S. J. Pister and L. E. Ghaoui}, 
  title =	 {Convex position estimation in wireless sensor 
                  networks}, 
  crossref =	 {infocom01}, 
  year =	 2001, 
  pages =	 {1655--1633}, 
  annote =	 {use the connectivity between nodes to formulate a 
                  set of geometric constraints and solve it using 
                  convex optimization. The resulting accuracy depends 
                  on the fraction of anchor nodes. For example, with 
                  10\% anchors the accuracy for unknowns is on the 
                  order of the radio range. A serious drawback, which 
                  is currently being addressed, is that convex 
                  optimization is performed by a single, centralized 
                  node.}, 
  url = 
                  {\url{http://www-bsac.eecs.berkeley.edu/~ldoherty/infocom.pdf}} 
} 
@InProceedings{DPR98, 
  author =	 {S. R. Das and C. E. Perkins and E. M. Royer}, 
  title =	 {Performance comparison of two on-demand routing 
                  protocols for ad hoc networks}, 
  crossref =	 {infocom00}, 
  pages =	 {3--12}, 
  annote =	 {}, 
  url =		 {} 
} 
@TechReport{DPS02:rng, 
  author =	 {J. D\'{i}az and J. Petit and M. Serna}, 
  title =	 {A random graph model for optical networks of 
                  sensors}, 
  institution =	 {Departament de Llenguatges i Sistemes Inform`atics, 
                  Universitat Polit`ecnica de Catalunya}, 
  year =	 2002, 
  number =	 {LSI-02-72-R}, 
  month =	 Dec, 
  annote =	 {To appear in IEEE Transaction on Mobile Computing 
                  2004}, 
  url =		 {\url{http://www.lsi.upc.es/dept/techreps/ps/R02-72.ps.gz}} 
} 
@TechReport{DPS02:rsg, 
  author =	 {J. D\'{i}az and J. Petit and M. Serna}, 
  title =	 {Random scaled sector graphs}, 
  institution =	 {Departament de Llenguatges i Sistemes Inform`atics, 
                  Universitat Polit`ecnica de Catalunya}, 
  year =	 2002, 
  number =	 {LSI-02-47-R}, 
  month =	 Jun, 
  annote =	 {}, 
  url =		 {\url{http://www.lsi.upc.es/dept/techreps/ps/R02-47.pdf}} 
} 
@InProceedings{DPS03, 
  author =	 {Josep Diaz and Jordi Petit and Maria Serna}, 
  title =	 {Evaluation of Basic Protocols for Optical Smart Dust 
                  Networks}, 
  booktitle =	 {Proceedings of Second International Workshop ({WEA}) 
                  2003}, 
  pages =	 {97--106}, 
  year =	 2003, 
  address =	 {Ascona, Switzerland}, 
  month =	 {May 26-28}, 
  abstract =	 {In this paper we analyze empirically the performance 
                  of several protocols for a random model of sensor 
                  networks that communicate through optical links. We 
                  provide experimental evidence of the basic 
                  parameters and of the performance of the distributed 
                  protocols described and analyzed under asymptotic 
                  assumptions in [3] for relatively small random 
                  networks (1000 to 15000 sensors). }, 
  url = 
                  {\url{http://link.springer.de/link/service/series/0558/papers/2647/26470097.pdf}} 
} 
@InCollection{DPS98:rgp, 
  author =	 {J. D\'{i}az and J. Petit and M. Serna}, 
  title =	 {Random Geometric Problems on $[0,1]^2$}, 
  booktitle =	 {Randomization and Approximation Techniques in 
                  Computer Science}, 
  pages =	 {294--306}, 
  publisher =	 {Springer-Verlag}, 
  year =	 1998, 
  editor =	 {J. Rolim and M. Luby and M. Serna}, 
  volume =	 {1518}, 
  series =	 {Lecture Notes in Computer Science}, 
  url =		 {} 
} 
@InProceedings{GQXY+04, 
  author =	 {David Goldenberg and Lili Qiu and Haiyong Xie and 
                  Yang Richard Yang and Yin Zhang}, 
  title =	 {Optimizing Cost and Performance for Multihoming}, 
  year =	 2004, 
  crossref =	 {sigcomm04} 
} 
 
 
@InProceedings{Cloudbound10, 
  author =	 {Mohammad Hajjat and Xin Sun and Yu-Wei Eric Sung and 
                  David Maltz and Sanjay Rao and Kunwadee 
                  Sripanidkulchai and Mohit Tawarmalani}, 
  title =	 {Cloudward Bound: Planning for Beneficial Migration 
                  of Enterprise Applications to the Cloud}, 
  year =	 2010, 
  crossref =	 {sigcomm10} 
} 
 
 
 
 
@Article{DRWT97, 
  author =	 {R. Dube and C. D. Rais and K. Wang and 
                  S. K. Tripathi}, 
  title =	 {Signal stability based adaptive routing ({SSA}) for 
                  ad hoc mobile networks}, 
  journal =	 {IEEE Personal Communication}, 
  year =	 1997, 
  month =	 Feb, 
  url =		 {} 
} 
@Article{DS96, 
  author =	 {M. B. Dillencourt and W. D. Smith}, 
  title =	 {Graph-theoretical conditions for inscribability and 
                  Delaunay realizability}, 
  journal =	 {Discrete Mathematics}, 
  year =	 1996, 
  volume =	 161, 
  pages =	 {63--67}, 
  month =	 Dec, 
  url =		 {\url{http://www.ics.uci.edu/~dillenco/pubs/new1ham.ps.gz}} 
} 
@InProceedings{DSR99, 
  author =	 {Constantinos Dovrolis and Dimitrios Stiliadis and 
                  Parameswaran Ramanathan } , 
  title =	 {{P}roportional differentiated services: {D}elay 
                  differentiation and packet scheduling} , 
  crossref =	 {sigcomm99}, 
  url =		 {} 
} 
@TechReport{DSS94, 
  author =	 {National Institute of Standards and Technology}, 
  title =	 {Digital Signature Standard}, 
  institution =	 {U.S. Department of Commerce}, 
  type =	 {NIST FIPS}, 
  number =	 {PUB 86}, 
  month =	 May, 
  year =	 1994 
} 
 
@TechReport{Mosaic10, 
  author =	 {L. E. Li and M.F. Nowlan and C. Tian and Y.R. Yang and M. Zhang}, 
  title =	 {Mosaic: Policy Homomorphic Network Extention}, 
  institution =	 {YaleCS}, 
  number =	 {TR1427}, 
  month =	 Feb, 
  year =	 2010 
} 
 
 
@InProceedings{DSW03, 
  author =	 {Rui Dai and Dale O. Stahl and Andrew B. Whinston}, 
  title =	 {The Economics of Smart Routing and {QoS}}, 
  booktitle =	 {Fifth International Workshop on Networked Group 
                  Communications ({NGC}'03) }, 
  year =	 2003 
} 
@Article{DW02, 
  author =	 {Qunfeng Dong and Zhijun Wu}, 
  title =	 {A geometric built-up algorithm for molecular 
                  distance geometry problems with sparse distance 
                  data}, 
  journal =	 {Journal of global optimization}, 
  year =	 2002, 
  url =		 {\url{http://www.math.iastate.edu/wu/sparse.ps}} 
} 
@InProceedings{Dee88, 
  author =	 {Stephen E. Deering}, 
  title =	 {Multicast Routing in Internetworks and Extended 
                  {LANs}}, 
  crossref =	 "sigcomm88", 
  abstract =	 {First proposal of multicast} 
} 
@manual{Dee89, 
  author =	 {Stephen Deering}, 
  title =	 {Host Extensions for {IP} Multicasting, {RFC} 1112}, 
  year =	 1989, 
  month =	 Jan, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1112.html}} 
} 
@Article{Dij57, 
  author =	 {E.W. Dijkstra}, 
  title =	 {A Note on Two Problems in Connection with Graphs}, 
  journal =	 {Numerical Mathematics}, 
  year =	 1959, 
  number =	 1, 
  pages =	 {269--271} 
} 
@InProceedings{Dow99, 
  author =	 {A. Downey}, 
  title =	 {Using pathchar to Estimate {I}nternet Link 
                  Characteristics}, 
  crossref =	 "sigcomm99", 
  year =	 1999, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm99/papers/session7-1.html}} 
} 
@Misc{E911, 
  key =		 {E911}, 
  title =	 {{E911}}, 
  howpublished = {Available at \url{http://www.fcc.gov/911/enhanced/}} 
} 
@inproceedings{EBAM02, 
  title =	 "A Framework for Maintaining Formations Based on 
                  Rigidity", 
  author =	 "T. Eren and P. N. Belhumeur and B. D. O. Anderson 
                  and A. S. Morse", 
  booktitle =	 "Proceedings of the 2002 IFAC Congress", 
  pages =	 "2752--2757", 
  year =	 2002, 
} 
@inproceedings{EBM02, 
  author =	 "T. Eren and P. N. Belhumeur and A.S. Morse", 
  title =	 "Closing Ranks in Vehicle Formations Based on 
                  Rigidity", 
  booktitle =	 "Proceedings of the 2002 IEEE Conference on Decision 
                  and Control", 
  year =	 2002, 
  month =	 Dec, 
  pages =	 "2959--2964 ", 
} 
@inproceedings{EBMW+04, 
  author =	 {T. Eren and P.N. Belhumeur and A.S. Morse and 
                  W. Whiteley and B.D.O. Anderson}, 
  title =	 {Splitting and Merging Rigid Formations}, 
  booktitle =	 "Proc. 2004 American control Conference", 
  year =	 2004, 
} 
@InProceedings{EE02, 
  author =	 {Tamer ElBatt and Anthony Ephremides}, 
  title =	 {Joint Scheduling and Power Control for Wireless 
                  Ad-hoc Networks}, 
  crossref =	 {infocom02}, 
  abstract =	 {In this paper we introduce power control as a 
                  solution to the multiple access problem in 
                  contention-based wireless ad-hoc networks. The 
                  motivation for this study is two fold, limiting 
                  multi-user interference to increase singlehop 
                  throughput, and reducing power consumption to 
                  increase battery life. We focus on next neighbor 
                  transmissions where nodes are required to send 
                  information packets to their respective receivers 
                  subject to a constraint on the 
                  signal-to-interference-and-noise ratio. The multiple 
                  access problem is solved via two alternating phases, 
                  namely scheduling and power control. The scheduling 
                  algorithm is essential to coordinate the 
                  transmissions of independent users in order to 
                  eliminate strong interference 
                  (e.g. selfinterference) that can not be overcome by 
                  power control. On the other hand, power control is 
                  executed in a distributed fashion to determine the 
                  admissible power vector, if one exists, that can be 
                  used by the scheduled users to satisfy their 
                  single-hop transmission requirements. This is done 
                  for two types of networks, namely TDMA and TDMA/CDMA 
                  wireless ad-hoc networks.}, 
  url =		 {\url{http://www.ieee-infocom.org/2002/papers/098.pdf}} 
} 
@InProceedings{GR97, 
  author =	 {R. Govindan and A. Reddy}, 
  title =	 {An analysis of {I}nternet inter-domain topology and 
                  route stability}, 
  crossref =	 {infocom97} 
} 
@Article{VGE00, 
  author =	 {K. Varadhan and R. Govindan and D. Estrin}, 
  title =	 {Persistent route oscillations in inter-domain 
                  routing.}, 
  journal =	 {Computer Networks}, 
  year =	 2000, 
  volume =	 32, 
  number =	 1, 
  pages =	 {1--16} 
} 
@inproceedings{EGHK99, 
  author =	 "Deborah Estrin and Ramesh Govindan and John 
                  S. Heidemann and Satish Kumar", 
  title =	 "Next Century Challenges: Scalable Coordination in 
                  Sensor Networks", 
  crossref =	 "mobicom99", 
  pages =	 "263--270", 
  year =	 1999, 
  url =		 {} 
} 
@InProceedings{EGK99, 
  author =	 {Deborah Estrin and John Heidemann and Ramesh 
                  Govindan and Satish Kumar }, 
  title =	 {Next Century Challenges: Scalable Coordination in 
                  Sensor Networks }, 
  crossref =	 {mobicom99}, 
  year =	 1999, 
  url =		 {\url{http://www.isi.edu/scadds/projects/diffusion.html}} 
} 
@Misc{EGT02, 
  author =	 {Alexander J. McKenzie}, 
  title =	 {Evolutionary Game Theory}, 
  howpublished = {The Stanford Encyclopedia of Philosophy (Fall 2002 
                  Edition), N. Zalta (ed.)}, 
  year =	 2002, 
  url = 
                  {\url{http://plato.stanford.edu/entries/game-evolutionary/}} 
} 
@InProceedings{EGWY+04, 
  author =	 {T. Eren and D. Goldenberg and W. Whitley and 
                  Y. R. Yang and A. S. Morse and B. D. O. Anderson and 
                  P. N. Belhumeur}, 
  title =	 {Rigidity, Computation, and Randomization of Network 
                  Localization}, 
  crossref =	 "infocom04" 
} 
@inproceedings{EKZ03, 
  author =	 {S. Eidenbenz and V. S. Anil Kumar and S. Zust}, 
  title =	 {Equilibria in topology control games for ad hoc 
                  networks}, 
  booktitle =	 {Proceedings of the 2003 Joint Workshop on 
                  Foundations of Mobile Computing}, 
  year =	 2003, 
  pages =	 {2--11}, 
  location =	 {San Diego, CA, USA}, 
} 
@InProceedings{ER00, 
  author =	 {Moncef Elaoud and Parameswaran Ramanathan}, 
  title =	 {Adaptive Allocation of CDMA Resources for 
                  Network-level QoS Assurances}, 
  crossref =	 "mobicom00", 
  abstract =	 {In a Code Division Multiple Access (CDMA) network, 
                  multiple mobile hosts (MHs) can simultaneously 
                  transmit over the wireless channel by using 
                  different codes. To assure an acceptable quality of 
                  service for all users' flows, the network usually 
                  tunes the transmit powers of all MHs to achieve a 
                  certain level of signal strength as compared to the 
                  noise and the interference (SINR) for each user. The 
                  traditional assumption in power control schemes is 
                  that the SINR requirement is statically determined 
                  for each user flow. In contrast, in this paper, we 
                  propose a scheme that dynamically adapts the SINR 
                  requirements of user flows based on its quality of 
                  service (QoS) requirements and the conditions of the 
                  wireless channel between the MHs and the base 
                  station. As a result of this adaptation, we show 
                  that network-level QoS measures such as fraction of 
                  packets meeting their delay requirements and energy 
                  consumed per packet transmission are significantly 
                  better than in a scheme that statically fixes the 
                  SINR requirements. Our scheme uses a simple 
                  table-driven approach for optimally selecting the 
                  target SINR requirement for each MH at run time. The 
                  entries in the table are computed offline using a 
                  dynamic programming algorithm with the objective of 
                  maximizing a profit function that balances the need 
                  for meeting the network-level QoS requirements and 
                  the cost of using a particular target SINR for a 
                  given transmission. } 
} 
@InProceedings{ES98, 
  author =	 {David A. Eckhardt and Peter Steenkiste}, 
  title =	 {Improving Wireless LAN Performance via Adaptive 
                  Local Error Control}, 
  crossref =	 "icnp98", 
  year =	 1998, 
  url =		 {} 
} 
@inproceedings{EWMB+03, 
  author =	 {T. Eren and W. Whiteley and A.S. Morse and 
                  P.N. Belhumeur and B. D. O. Anderson}, 
  title =	 {Sensor and Network Topologies of Formations with 
                  Distance, Bearing, and Angle Information Between 
                  Agents}, 
  booktitle =	 {Proc. 42nd IEEE Conference on Decision and Control, 
                  Hawaii}, 
  year =	 2003, 
  pages =	 "3064--3069", 
} 
@inproceedings{ElGamal84, 
  author =	 {T. El~Gamal}, 
  title =	 {A Public-Key Cryptosystem and a Signature Scheme 
                  Based on Discrete Logarithms}, 
  booktitle =	 crypto84, 
  publisher =	 {Springer-Verlag}, 
  year =	 1985 
} 
@article{ElGamal85, 
  author =	 {T. El~Gamal}, 
  title =	 {A Public-Key Cryptosystem and a Signature Scheme 
                  Based on Discrete Logarithms}, 
  journal =	 toit, 
  pages =	 {469--472}, 
  volume =	 {IT-31}, 
  number =	 4, 
  year =	 1985 
} 
@article{Eri94, 
  author =	 {H. Eriksson}, 
  title =	 {MBone: the Multicast Backbone}, 
  journal =	 {Communications of the ACM}, 
  volume =	 37, 
  number =	 8, 
  pages =	 {54--60}, 
  month =	 aug, 
  year =	 1994 
} 
@InProceedings{F+99, 
  author =	 {P. Francis et. al.}, 
  title =	 {An Architecture for a Global Internet Host Distance 
                  Estimation Service}, 
  crossref =	 {infocom99}, 
  year =	 1999, 
  url =		 {\url{http://idmaps.eecs.umich.edu/papers/infocom99.ps.gz}} 
} 
@Misc{F5Networks, 
  key =		 {F5 Networks, Inc.}, 
  author =	 {{F5 Networks, Inc.}}, 
  howpublished = {\url{http://www.f5networks.com/}}, 
  note =	 {} 
} 
@InProceedings{FB00, 
  author =	 {Victor Firoiu and Marty Borden}, 
  title =	 {A Study of Active Queue Management for Congestion 
                  Control}, 
  crossref =	 "infocom00", 
  pages =	 "1435--1444", 
  year =	 2000, 
  url =		 {} 
} 
@Article{FBR03, 
  author =	 {N. Feamster and J. Borkenhagen and J. Rexford}, 
  title =	 {Guidelines for Interdomain Traffic Engineering}, 
  journal =	 {{ACM} {SIGCOMM} Computer Communications Review}, 
  year =	 2003, 
  month =	 Oct, 
  url = 
                  {http://nms.lcs.mit.edu/~feamster/papers/ccr2003-bgpte.pdf]} 
} 
@InProceedings{FR02, 
  author =	 {N. Feamster and J. Rexford}, 
  title =	 {Network-Wide {BGP} Route Prediction for Traffic 
                  Engineering}, 
  booktitle =	 {Proceedings of {ITCOM}}, 
  year =	 2002, 
  address =	 {Boston, MA}, 
  month =	 Aug, 
  url = 
                  {\url{http://nms.lcs.mit.edu/~feamster/papers/itcom2002.pdf}} 
} 
@inproceedings{FWR04, 
  author =	 {Nick Feamster and Jared Winick and Jennifer Rexford}, 
  title =	 {A Model of {BGP} routing for network engineering}, 
  crossref =	 {sigmetrics04}, 
  year =	 2004, 
  isbn =	 {1-58113-873-3}, 
  pages =	 {331--342}, 
  location =	 {New York, NY, USA}, 
  doi =		 {http://doi.acm.org/10.1145/1005686.1005726}, 
  publisher =	 {ACM Press} 
} 
@InProceedings{FBB01, 
  author =	 {Nick Feamster and Deepak Bansal and Hari 
                  Balakrishnan}, 
  title =	 {On the Interactions Between Layered Quality 
                  Adaptation and Congestion Control for Streaming 
                  Video}, 
  booktitle =	 {11th International Packet Video Workshop ({PV}2001)}, 
  year =	 2001, 
  address =	 {Kyongju, Korea}, 
  month =	 Apr, 
  url =		 {\url{http://nms.lcs.mit.edu/projects/videocm/}} 
} 
@InProceedings{FBH03, 
  author =	 {M. Felegyhazi and Levente Buttyan and J. P. Hubaux}, 
  title =	 {Equilibrium Analysis of Packet Forwarding Strategies 
                  in Wireless Ad Hoc Networks -- the Static Case}, 
  booktitle =	 {Proceedings of Personal Wireless Communications 
                  ({PWC} `03)}, 
  year =	 2003, 
  address =	 {Venice, Italy}, 
  month =	 Sep, 
  url = 
                  {\url{http://lcawww.epfl.ch/Publications/Felegyhazi/FelegyhaziBH03.pdf}} 
} 
@Article{SMG02, 
  author =	 {C. Saraydar and N. Mandayam and D. Goodman}, 
  title =	 {Efficient power control via pricing in wireless data 
                  networks}, 
  journal =	 {IEEE Trasnactions on Communications}, 
  year =	 2002, 
  volume =	 50, 
  number =	 2, 
  pages =	 {291--303}, 
  month =	 Feb 
} 
@InProceedings{FCAB98, 
  author =	 {Li Fan and Pei Cao and Jussara Almeida and Andrei 
                  Broder}, 
  title =	 {Summary Cache: A Scalable Wide-Area Web Cache 
                  Sharing Protocol }, 
  crossref =	 "sigcomm98", 
  abstract =	 {Use bllom filter for summary cache}, 
  url =		 {\url{http://www.acm.org/sigcomm/sigcomm98/tp/abs_21.html}} 
} 
@Article{FD01, 
  author =	 {Michael J. Fischer and Z. Diamadi}, 
  title =	 {A simple game for the study of trust in distributed 
                  systems}, 
  journal =	 {Wuhan University Journal of Natural Sciences}, 
  year =	 2001, 
  volume =	 6, 
  number =	 {1-2}, 
  pages =	 {72--82} 
} 
@Article{FF96, 
  author =	 {K. Fall and S. Floyd}, 
  title =	 {Simulation-based Comparisons of {Tahoe}, {Reno}, and 
                  {SACK} {TCP}}, 
  journal =	 ccr, 
  year =	 {1996}, 
  volume =	 {26}, 
  number =	 {3}, 
  pages =	 {5--21}, 
  month =	 Jul, 
  abstract =	 {}, 
  url =		 {ftp://ftp.ee.lbl.gov/papers/sacks_v0.ps.Z} 
} 
@TechReport{FF97, 
  author =	 {S. Floyd and K. Fall}, 
  title =	 {Router Mechanisms to Support End-to-End Congestion 
                  Control}, 
  institution =	 {Lawrence Berkeley Labs}, 
  year =	 {1997}, 
  month =	 Feb, 
  abstract =	 {} 
} 
@Article{FF99, 
  author =	 {Sally Floyd and Kevin Fall}, 
  title =	 {Promoting the use of end-to-end congestion control 
                  in the {I}nternet}, 
  journal =	 ton, 
  volume =	 7, 
  number =	 4, 
  year =	 {1999}, 
  month =	 aug, 
  abstract =	 {} 
} 
@InProceedings{FFF99, 
  author =	 {M. Faloutsos and P. Faloutsos and C. Faloutsos}, 
  title =	 {On Power-Low Relationships of the Internet Topology}, 
  crossref =	 {sigcomm99}, 
  year =	 {1999} 
} 
@inproceedings{FG95, 
  author =	 "Chane L. Fullmer and J. J. Garcia-Luna-Aceves", 
  title =	 "Floor Acquisition Multiple Access ({FAMA}) for 
                  Packet-Radio Networks", 
  crossref =	 "sigcomm95", 
  pages =	 "262--273", 
  year =	 1995, 
  annote =	 {}, 
  url =		 {} 
} 
@Unpublished{FGS01, 
  author =	 {Sally Floyd and Ramakrishna Gummadi and Scott 
                  Shenker}, 
  title =	 {Adaptive {RED}: An Algorithm for Increasing the 
                  Robustness of {RED}'s Active Queue Management}, 
  note =	 {submit for publication.}, 
  month =	 Aug, 
  year =	 2001, 
  url =		 {\url{http://www.aciri.org/floyd/papers/adaptiveRed.pdf}} 
} 
@InCollection{FH95, 
  author =	 {M. Florian and D. Hearn}, 
  editor =	 {M. O. Ball and T. Magnanti and C. Monma and 
                  G. Nemhauser}, 
  booktitle =	 {Network Routing}, 
  title =	 {Network equilibrium models and algorithms}, 
  publisher =	 {Elsevier Science}, 
  year =	 1995, 
  pages =	 {485--550} 
} 
@Unpublished{FHP00, 
  author =	 {Sally Floyd and Mark Handley and Jitendra Padhye}, 
  title =	 {A Comparison of Equation-based Congestion Control 
                  and {AIMD}-based Congestion Control}, 
  note =	 {Work-in-progress, available at 
                  \url{http://www.aciri.org/tfrc}}, 
  year =	 2000, 
  abstract =	 {} 
} 
@InProceedings{FHPW00, 
  author =	 {Sally Floyd and Mark Handley and Jitendra Padhye and 
                  J\"{o}rg Widmer}, 
  title =	 {Equation-Based Congestion Control for Unicast 
                  Applications}, 
  crossref =	 "sigcomm00", 
  abstract =	 {TFRC} 
} 
@Article{FJ92, 
  author =	 {Sally Floyd and Van Jacobson}, 
  title =	 {On Traffic Phase Effects in Packet-Switched 
                  Gateways}, 
  journal =	 {Internetworking: Research and Experience}, 
  year =	 {1992}, 
  volume =	 {3}, 
  number =	 {3}, 
  month =	 sep, 
  abstract =	 {} 
} 
@Article{FJ93, 
  author =	 {S. Floyd and V. Jacobson}, 
  title =	 {Random Early Detection Gateways for Congestion 
                  Avoidance}, 
  journal =	 ton, 
  year =	 {1993}, 
  volume =	 {1}, 
  number =	 {4}, 
  pages =	 {397--413}, 
  month =	 aug, 
  abstract =	 {Propose RED.}, 
  url =		 {\url{http://www-nrg.ee.lbl.gov/papers/red/red.html}} 
} 
@Article{FJJJ01, 
  title =	 {{IDMaps}: A Global {I}nternet Host Distance 
                  Estimation Service}, 
  author =	 {P. Francis and S. Jamin and C. Jin and Y. Jin and 
                  D. Raz and Y. Shavitt and L. Zhang}, 
  journal =	 {{IEEE/ACM} Transactions on Networking}, 
  year =	 2001, 
  month =	 Oct, 
  note =	 {measure raw latency}, 
  url =		 {\url{http://idmaps.eecs.umich.edu/papers/ton01.pdf}} 
} 
@article{FJLM+97, 
  author =	 {Floyd, S. and Jacobson, V. and Liu, C. and McCanne, 
                  S. and Zhang, L.}, 
  title =	 {A Reliable Multicast Framework for Light-weight 
                  Sessions and Application Level Framing}, 
  journal =	 ton, 
  year =	 {1997}, 
  volume =	 {5}, 
  number =	 {6}, 
  pages =	 {784--803}, 
  abstract =	 { }, 
  url =		 {ftp://ftp.ee.lbl.gov/papers/srm.ps.Z} 
} 
@InProceedings{FJP96, 
  author =	 {H. Federrath and A. Jerichow and A. Pfitzmann}, 
  title =	 {{MIXes} in Mobile Communication Systems: Location 
                  Management with Privacy}, 
  booktitle =	 {Information Hiding}, 
  pages =	 {121--135}, 
  year =	 1996, 
  annote =	 {location} 
} 
@Misc{FKK96, 
  author =	 {Alan O. Freier and Philip Karlton and Paul 
                  C. Kocher}, 
  title =	 {The {SSL} Protocol Version 3.0}, 
  howpublished = {Work in progress, IETF Internet-Draft}, 
  month =	 Mar, 
  year =	 1996 
} 
@InProceedings{FKSS99, 
  author =	 {W. Feng and D. D. Kandlur and D. Saha and 
                  K. G. Shin}, 
  title =	 {A self-configuring {RED} gateway}, 
  crossref =	 "infocom99", 
  abstract =	 {}, 
  url =		 {} 
} 
@Book{FL98, 
  author =	 {D. Fudenberg and D. Levine}, 
  title =	 {Theory of Learning in Games}, 
  publisher =	 {{MIT} Press}, 
  year =	 1998, 
  address =	 {Cambridge, MA} 
} 
@Article{FLP85, 
  author =	 {Michael J. Fischer and Nancy A. Lynch and Michael 
                  S. Paterson}, 
  title =	 {Impossibility of distributed consensus with one 
                  faulty process}, 
  journal =	 {Journal of the ACM}, 
  year =	 1985, 
  volume =	 32, 
  number =	 2, 
  pages =	 {374--382}, 
  month =	 Apr, 
  url = 
                  {\url{http://theory.lcs.mit.edu/tds/papers/Lynch/jacm85.pdf}} 
} 
@Article{FM92, 
  author =	 {W. Fischer and K. Meier-Hellstern}, 
  title =	 {The {M}arkov-modulated {P}oisson process ({MMPP}) 
                  cookbook}, 
  journal =	 {Performance Evaluation}, 
  year =	 1992, 
  volume =	 18, 
  pages =	 {149--171} 
} 
@Article{FM93, 
  author =	 {G. J. Foschini and Z. Miljanic}, 
  title =	 {A simple distributed autonomous power control 
                  algorithm and its convergence}, 
  journal =	 {IEEE Transactions on Vehicular Technology}, 
  year =	 1993, 
  volume =	 42, 
  pages =	 {641--646}, 
  month =	 Nov, 
  annote =	 {the original CDMA power control} 
} 
@inproceedings{FN93, 
  author =	 {Amos Fiat and Moni Naor}, 
  title =	 {Broadcast Encryption}, 
  pages =	 {480--491}, 
  booktitle =	 crypto93, 
  year =	 1993, 
  abstract =	 {crypto} 
} 
@InProceedings{FP03, 
  author =	 {Eric J. Friedman and D. Parkes}, 
  title =	 {Pricing {WiFi} at {Starbucks} -- Issues in Online 
                  Mechanism Design}, 
  crossref =	 {ec03}, 
  year =	 2003, 
  url = 
                  {\url{http://www.orie.cornell.edu/~friedman/pfiles/wifi.pdf}} 
} 
@InProceedings{FPT04, 
  title =	 {On the Complexity of Pure Equilibria}, 
  author =	 {Alex Fabrikant and Christos H. Papadimitriou and 
                  Kunal Talwar}, 
  crossref =	 {stoc04}, 
  url = 
                  {\url{http://www.cs.berkeley.edu/~christos/papers/pure.ps}} 
} 
@Article{FPS01, 
  author =	 {Joan Feigenbaum and Christos Papadimitriou and Scott 
                  Shenker}, 
  title =	 {Sharing the Cost of Multicast Transmissions}, 
  journal =	 {Journal of Computer and System Sciences (Special 
                  issue on {I}nternet Algorithms)}, 
  year =	 2001, 
  volume =	 63, 
  pages =	 {21--41}, 
  url =		 {\url{http://cs-www.cs.yale.edu/homes/jf/FPS.pdf}} 
} 
@InProceedings{FPSS02, 
  author =	 {Joan Feigenbaum and Christos Papadimitriou and Rahul 
                  Sami and Scott Shenker}, 
  title =	 {A {BGP}-based Mechanism for Lowest-Cost Routing}, 
  crossref =	 {podc02}, 
  pages =	 {173--182}, 
  year =	 2002, 
  url =		 {\url{http://www.cs.yale.edu/homes/jf/FPSS.pdf}} 
} 
@InProceedings{Afe04, 
  author =	 {Mike Afergan}, 
  title =	 {Repeated Game Analysis of {I}nternet Routing 
                  (extended abstract)}, 
  crossref =	 {podc04}, 
  url = 
                  {\url{http://www.mit.edu/~afergan/papers/rrouting_podc04.pdf}} 
} 
@InProceedings{FRM01, 
  author =	 {Krisztian Flautner and Steve Reinhardt and Trevor 
                  Mudge}, 
  title =	 {Automatic Performance-Setting for Dynamic Voltage 
                  Scaling}, 
  crossref =	 "mobicom01", 
  abstract =	 {The emphasis on processors that are both low-power 
                  and high-performance has resulted in the 
                  incorporation of dynamic voltage scaling into 
                  processor designs. This feature allows one to make 
                  fine granularity trade-offs between power use and 
                  performance, provided there is a mechanism in the OS 
                  to control that trade-off. In this paper, we 
                  describe a novel software approach to automatically 
                  controlling dynamic performance and voltage scaling 
                  to optimize energy use. Our mechanism is implemented 
                  in the Linux kernel and requires no modification of 
                  user programs. Unlike previous automated approaches, 
                  our method works equally well with irregular and 
                  multiprogrammed workloads. Moreover, it has the 
                  ability to ensure that the quality of interactive 
                  performance is within user specified parameters. Our 
                  experiments show that as a result of our algorithm, 
                  processor energy savings of as much as 75\% can be 
                  achieved with only a minimal impact on the user 
                  experience.} 
} 
@Article{FRT02, 
  author =	 {Bernard Fortz and Jennifer Rexford and Mikkel 
                  Thorup}, 
  title =	 {Traffic Engineering with Traditional {IP} Routing 
                  Protocols}, 
  journal =	 {{IEEE} Communication Magazine}, 
  year =	 2002, 
  month =	 Oct, 
  url =		 {\url{http://www.research.att.com/~jrex/papers.html}} 
} 
@InProceedings{FS01, 
  author =	 {Andras Farago and Violet R. Syrotiuk}, 
  title =	 {{MERIT}: A Unified Framework for Routing Protocol 
                  Assessment in Mobile Ad Hoc Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {MERIT is a framework to assess routing protocols in 
                  mobile ad hoc networks (manets). It is based on the 
                  concept of shortest mobile path (SMP) in a mobile 
                  graph. As a standard measure for routing protocols 
                  in a manet, the MERIT framework proposes the mean 
                  ratio of the cost of the actually used route to the 
                  cost of the optimal mobile path, under the same 
                  history of link metrics in the changing network 
                  topology. This MEan Real vs. Ideal cosT (MERIT) 
                  ratio is unifying in that it provides a measure that 
                  allows a protocol to be assessed independently of 
                  other protocols, within its own framework. We show 
                  that there is an efficient algorithm to solve the 
                  underlying SMP problem for important cases, making 
                  the approach practically feasible. We also 
                  investigate generalizations and extensions within 
                  the MERIT framework.} 
} 
@InProceedings{FS02, 
  author =	 {Joan Feigenbaum and Scott Shenker}, 
  title =	 {Distributed Algorithmic Mechanism Design: Recent 
                  Results and Future Directions}, 
  booktitle =	 {Proceedings of the 6th International Workshop on 
                  Discrete Algorithms and Methods for Mobile Computing 
                  and Communications}, 
  pages =	 {1--13}, 
  year =	 2002, 
  month =	 Sep, 
  publisher =	 {{ACM} Press}, 
  url =		 {\url{http://www.cs.yale.edu/homes/jf/FS.pdf}} 
} 
@Unpublished{FS03:incentivetut, 
  author =	 {Joan Feigenbaum and Scott Shenker}, 
  title =	 {Incentives and {I}nternet Algorithms}, 
  note =	 {Tutorial given at PODC 2003. Available at 
                  \url{http://www.cs.yale.edu/\verb$~$jf/PODC03.ppt}}, 
  month =	 Jul, 
  year =	 2003 
} 
@Unpublished{FS97, 
  author =	 {Eric Friedman and Scott Shenker}, 
  title =	 {Learning and Implementation on the {I}nternet}, 
  note =	 {Working paper. Available at 
                  \url{http://www.orie.cornell.edu/~friedman/pfiles/decent.ps}}, 
  year =	 1997, 
  url = 
                  {\url{http://www.orie.cornell.edu/~friedman/pfiles/decent.ps}} 
} 
@InProceedings{FP99, 
  author =	 {Wenjia Fang and Larry Peterson}, 
  title =	 {Inter-AS Traffic Patterns and Their Implications}, 
  booktitle =	 {Proceedings of the 4th Global {I}nternet Symposium}, 
  address =	 "Rio de Janeiro, Brazil", 
  month =	 Dec, 
  year =	 1999, 
  url = 
                  {\url{http://www.cs.princeton.edu/nsg/papers/fang_GIS_1999.html}} 
} 
@Misc{FSN99, 
  author =	 {W. Fang and N. Seddigh and B. Nandy.}, 
  title =	 {A Time Sliding Window Three Colour Marker 
                  ({TSWTCM})}, 
  year =	 1999, 
  month =	 Oct, 
  howpublished = {IETF Internet-Draft, 
                  draft-fang-diffserv-tc-tswtcm-00.txt}, 
  abstract =	 {Intserv} 
} 
@Article{FSSS03, 
  author =	 {Eric Friedman and Michael Shor and Scott Schenker 
                  and Barry Sopher}, 
  title =	 {An Experiment on Learning with Limited Information: 
                  Nonconvergence, Experimentation Cascades, and the 
                  Advantage of Being Slow}, 
  journal =	 {Games and Economic Behavior}, 
  year =	 2003, 
  url = 
                  {\url{http://mba.vanderbilt.edu/Mike.Shor/research/Async/asynca.html}} 
} 
@InProceedings{FT00tcp, 
  author =	 {W. Feng and P. Tinnakornsrisuphap}, 
  title =	 {The Adverse Impact of the {TCP} Congestion-Control 
                  Mechanism in Heterogeneous Computing Systems}, 
  booktitle =	 {International Conference on Parallel Processing 
                  ({ICPP} '00)}, 
  year =	 2000, 
  month =	 aug, 
  url =		 {} 
} 
@InProceedings{FT00, 
  author =	 {Bernard Fortz and Mikkel Thorup}, 
  title =	 {{I}nternet Traffic Engineering by Optimizing {OSPF} 
                  Weights}, 
  crossref =	 {infocom00}, 
  year =	 2000, 
  url = 
                  {\url{http://www.research.att.com/~mthorup/PAPERS/papers.html}} 
} 
@Article{FT01, 
  author =	 {M. Furini and D.F. Towsley}, 
  title =	 {Real-time traffic transmission over the {I}nternet}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909592.pdf?isNumber=19626}} 
} 
@Book{FT91, 
  author =	 {Drew Fudenberg and Jean Tirole}, 
  title =	 {Game Theory}, 
  publisher =	 {The {MIT} Press}, 
  year =	 1991 
} 
@InProceedings{FYZ01, 
  author =	 {Victor Firoiu and Ikjun Yeom and Xiaohui Zhang}, 
  title =	 {A Framework for Practical Performance Evaluation and 
                  Traffic Engineering in {IP} Networks}, 
  booktitle =	 {IEEE ICT 2001}, 
  url = 
                  {\url{http://www-net.cs.umass.edu/~vfiroiu/papers/temodel-conf.pdf}}, 
  year =	 2001 
} 
@Article{FZ94, 
  author =	 "G. H. Forman and J. Zahorjan", 
  title =	 "The Challenges of Mobile Computing", 
  journal =	 {{IEEE} Computer}, 
  volume =	 27, 
  number =	 4, 
  month =	 Apr, 
  year =	 1994, 
  pages =	 {38--47}, 
  url =		 {} 
} 
@InProceedings{SRS99, 
  author =	 {A. Shaikh and J. Rexford and K. G. Shin}, 
  title =	 {Load-Sensitive Routing of Long-Lived {IP} Flows}, 
  crossref =	 {sigcomm99}, 
  year =	 1999 
} 
@InProceedings{SGD03, 
  author =	 {A. Sridharan and R. Guerin and C. Diot}, 
  title =	 {Achieving Near Optimal Traffic Engineering Solutions 
                  in Current {OSPF/ISIS} Networks}, 
  crossref =	 {infocom03}, 
  year =	 2003, 
  url = 
                  {\url{http://www.seas.upenn.edu/~guerin/Publications/split_hops-Dec19.pdf}} 
} 
@Article{Fan97, 
  author =	 {Yuguang Fang}, 
  title =	 {A General Sufficient Condition for Almost Sure 
                  Stability of Jump Linear Systems}, 
  journal =	 {{IEEE} Transactions on Automatic Control}, 
  year =	 1997, 
  volume =	 42, 
  number =	 3, 
  pages =	 {378--382}, 
  url =		 {\url{http://www-ec.njit.edu/~fang/mypapers/tac97_3.pdf}} 
} 
@inproceedings{Far02, 
  author =	 {Andras Farago}, 
  title =	 {Scalable analysis and design of ad hoc networks via 
                  random graph theory}, 
  booktitle =	 {Proceedings of the 6th international workshop on 
                  Discrete algorithms and methods for mobile computing 
                  and communications}, 
  year =	 2002, 
  isbn =	 {1-58113-587-4}, 
  pages =	 {43--50}, 
  location =	 {Atlanta, Georgia, USA}, 
  url =		 {\url{http://doi.acm.org/10.1145/570810.570816}}, 
  publisher =	 {ACM Press}, 
} 
@manual{Fen97, 
  author =	 {Fenner, W.}, 
  title =	 {{Internet} Group Management Protocol, version 2, 
                  {RFC} 2236}, 
  year =	 {1997}, 
  month =	 nov, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2236.html}} 
} 
@Misc{Fer03, 
  author =	 {Pedro Miguel Ferreira}, 
  title =	 {A model for Interconnection of {IP} networks}, 
  howpublished = {Available at 
                  \url{http://www.andrew.cmu.edu/~pferreir/QualsPaper.pdf}}, 
  annote =	 {figure 7 on page 15} 
} 
@Misc{Fer03, 
  author =	 {Pedro Miguel Ferreira}, 
  title =	 {A model for Interconnection of {IP} networks}, 
  month =	 Jan, 
  year =	 2003, 
  howpublished = {available at 
                  \url{http://www.andrew.cmu.edu/~pferreir/QualsPaper.pdf}} 
} 
@Misc{Flirtylizer01, 
  key =		 {Flirtylizer}, 
  title =	 {Flirtylizer - The First Mobile Dating Service With 
                  Positioning}, 
  howpublished = {Available at 
                  \url{http://www.mobiletechnews.com/info/2001/02/13/123358.html}}, 
  year =	 2001 
} 
@Misc{Flo00, 
  title =	 {Congestion Control Principles}, 
  author =	 {Sally Floyd}, 
  year =	 2000, 
  howpublished = {(IETF INTERNET DRAFT)}, 
  abstract =	 {} 
} 
@Article{Flo62, 
  title =	 {Algorithm 97 (Shortest Path)}, 
  author =	 {R.W. Floyd}, 
  journal =	 {Communications of the {ACM}}, 
  year =	 1962, 
  volume =	 5, 
  number =	 6 
} 
@Unpublished{Fri01, 
  author =	 {E.J. Friedman}, 
  title =	 {A Generic Analysis of Selfish Routing}, 
  note =	 {Working paper. Available from 
                  \url{http://www.orie.cornell.edu/~friedman/papers.html}}, 
  year =	 2001 
} 
@Unpublished{Fri02, 
  author =	 {E.J. Friedman}, 
  title =	 {Selfish Routing on Data Networks Isn't Too Bad: 
                  Genericity, {TCP}, and {OSPF}}, 
  note =	 {Working paper. Available from 
                  \url{http://www.orie.cornell.edu/~friedman/papers.html}}, 
  month =	 {Oct.}, 
  year =	 2002 
} 
@InProceedings{GAPK01, 
  author =	 {Tom Goff and Nael Abu-Ghazaleh and Dhananjay Phatak 
                  and Ridvan Kahvecioglu}, 
  title =	 {Preemptive Route Maintenance in Ad Hoc Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {Existing on-demand ad-hoc routing algorithms 
                  initiate route discovery only AFTER a path breaks, 
                  incurring a significant cost in detecting the 
                  disconnection and establishing a new route. In this 
                  work, we investigate adding preemptive route 
                  maintenance to on-demand ad-hoc routing 
                  algorithms. More specifically, when a path is likely 
                  to be broken, a warning is sent to the source 
                  indicating the likelihood of a disconnection. The 
                  source can then initiate path discovery early, 
                  potentially avoiding the disconnection altogether. A 
                  path is considered likely to break when the received 
                  packet power becomes close to the minimum detectable 
                  power (other approaches are possible). Care must be 
                  taken to avoid initiating false route warnings due 
                  to fluctuations in received power caused by fading, 
                  multipath effects and other transient 
                  phenomena. Experiments demonstrate that adding 
                  preemptive route selection and maintenance to DSR 
                  and AODV (on-demand ad hoc routing protocols) 
                  significantly reduces the number of broken paths, 
                  with a small increase in the number of control 
                  packets generated. Packet latency and jitter are 
                  also reduced. Pro-active route selection and 
                  maintenance is general and can be used with other 
                  routing algorithms and optimizations to them.} 
} 
@Article{GB81, 
  author =	 {E. Gafni and D. Bertsekas}, 
  title =	 {Distributed algorithms for generating loop-free 
                  routes in networks with frequently changing 
                  topology}, 
  journal =	 {IEEE Transactions on Communications}, 
  year =	 1981, 
  volume =	 {C-29}, 
  number =	 1, 
  pages =	 {11--18}, 
  annote =	 {Link reversal}, 
  url =		 {} 
} 
@InProceedings{GB98, 
  author =	 {J. Golestani and S. Bhattacharyya}, 
  title =	 {A Class of End-to-End Congestion Control Algorithms 
                  for the {Internet}}, 
  crossref =	 "icnp98", 
  abstratc =	 {utility} 
} 
@InProceedings{GBG04, 
  author =	 {Marco Gruteser and Jonathan Bredin and Dirk 
                  Grunwald}, 
  title =	 {Path Privacy in Location-aware Computing}, 
  booktitle =	 {Proceedings of {MobiSys} 2004 Workshop on Context 
                  Awareness }, 
  year =	 2004, 
  annote =	 {location} 
} 
@InProceedings{GC98, 
  author =	 {Panos Gevros and Jon Crowcroft}, 
  title =	 {Experimental Results on Weighted Proportional {TCP} 
                  Throughput Differentiation}, 
  booktitle =	 {Proceedings of HIPPARCH '98}, 
  year =	 1998, 
  address =	 {University College London, UK}, 
  month =	 jun, 
  url =		 { 
                  \url{http://www.cs.ucl.ac.uk/staff/P.Gevros/hipparch98/hipparch98-paper.ps.gz}} 
} 
@InProceedings{GCLC04, 
  author =	 {Fanglu Guo and Jiawu Chen and Wei Li and Tzi-Cker 
                  Chiueh}, 
  title =	 {Experiences in Building A Multihoming Load Balancing 
                  System }, 
  crossref =	 {infocom04}, 
  url =		 {} 
} 
@inProceedings{GE01, 
  author =	 "L. Girod and D. Estrin", 
  title =	 "Robust Range Estimation Using Acoustic And 
                  Multimodal Sensing", 
  booktitle =	 "{IEEE/RSI} International Conference on Intelligent 
                  Robots and Systems ({IROS})", 
  year =	 2001, 
  url =		 {} 
} 
@InProceedings{GG03:cloaking, 
  author =	 {Marco Gruteser and Dirk Grunwald}, 
  title =	 {Anonymous Usage of Location-Based Services Through 
                  Spatial and Temporal Cloaking}, 
  crossref =	 {mobisys03}, 
  url = 
                  {\url{http://systems.cs.colorado.edu/Papers/Generated/2003anonymousLbs.html}}, 
  annote =	 {location} 
} 
@InProceedings{GG03:id, 
  author =	 {Marco Gruteser and Dirk Grunwald}, 
  title =	 {Enhancing Location Privacy in Wireless LAN Through 
                  Disposable Interface Identifiers: A Quantitative 
                  Analysis}, 
  booktitle =	 {WMASH '03}, 
  year =	 2003, 
  month =	 Sep, 
  address =	 {San Diego, CA}, 
  url =		 { 
                  \url{http://systems.cs.colorado.edu/Papers/Generated/2003wlanDisposable.pdf}}, 
  annote =	 {location} 
} 
@article{GGMM88, 
  author =	 "Jonathan Goodman and Albert G. Greenberg and Neal 
                  Madras and Peter March", 
  title =	 "Stability of Binary Exponential Backoff", 
  journal =	 "Journal of the ACM", 
  volume =	 35, 
  number =	 3, 
  pages =	 "579--602", 
  year =	 1988, 
  url =		 {} 
} 
@Book{GH98, 
  author =	 {Donald Gross and Carl Harris}, 
  title =	 {Fundamentals of Queueing Theory}, 
  publisher =	 {John Wiley}, 
  year =	 1998, 
  edition =	 {3rd} 
} 
@TechReport{GH99, 
  author =	 {S. Giordano and M. Hamdi}, 
  title =	 {Management: The Virtual Home Region}, 
  year =	 1999, 
  number =	 {SSC/1999/037}, 
  month =	 {Oct.}, 
  annote =	 {Using a hash function on node ID to determine a 
                  node's home zone; any node whose distance is less 
                  than R should store the location} 
} 
@Article{GHR93, 
  author =	 {W. Glunt and T.L. Hayden and M. Raydan}, 
  title =	 {Molecular Conformation From Distance Matrices}, 
  journal =	 {Journal of Computational Chemistry}, 
  year =	 1993, 
  volume =	 14, 
  pages =	 {114--120}, 
  annote =	 {simulated annealing} 
} 
@InProceedings{GHT04, 
  author =	 {Andreas Gorlach and Andreas Heinemann and Wesley 
                  W. Terpstra}, 
  title =	 {Survey on Location Privacy in Pervasive Computing}, 
  booktitle =	 {Workshop on Security and Privacy in Pervasive 
                  Computing}, 
  year =	 2004, 
  month =	 Apr, 
  url = 
                  {\url{http://www.ito.tu-darmstadt.de/publs/pdf/SurveyOnLocationPrivacy.pdf}}, 
  annote =	 {location} 
} 
@inproceedings{GI99, 
  author =	 "Ashish Goel and Piotr Indyk", 
  title =	 "Stochastic Load Balancing and Related Problems", 
  booktitle =	 "{IEEE} Symposium on Foundations of Computer Science", 
  pages =	 "579--586", 
  year =	 1999, 
  url =		 {} 
} 
@Book{GJ79, 
  author =	 {M.R. Garey and D.S. Johnson}, 
  title =	 {Computers and Intractability}, 
  publisher =	 {W.H. Freeman and Co.}, 
  year =	 1979, 
  address =	 {New York, NY}, 
} 
@Article{GJPV+91, 
  author =	 {K. S. Gilhousen and I. M. Jacobs and R. Padovani and 
                  A. J. Viterbi and L. A. Weaver and C. E. Wheatley 
                  III}, 
  title =	 {On the capacity of a cellular {CDMA} system}, 
  journal =	 {IEEE Trans. Vehicular Tech}, 
  year =	 1991, 
  volume =	 40, 
  number =	 2, 
  pages =	 {303--312} 
} 
@Article{GK00, 
  author =	 {P. Gupta and P. R. Kumar}, 
  title =	 {The capacity of wireless networks}, 
  journal =	 {{IEEE} Transactions on Information Theory}, 
  year =	 2001, 
  volume =	 46, 
  number =	 2, 
  pages =	 {388--404}, 
  month =	 Jan 
} 
@inproceedings{GK97, 
  author =	 "Piyush Gupta and P.R. Kumar", 
  title =	 "A System and Traffic Dependent Adaptive Routing 
                  Algorithm for Ad Hoc Networks", 
  booktitle =	 "Proceedings of the 36th Conference on Decision \& 
                  Control", 
  pages =	 "2375--2380", 
  year =	 1997, 
  url =		 "\url{http://decision.csl.uiuc.edu/~piyush/wnr_cdc.ps}" 
} 
@misc{GK99, 
  author =	 "P. Gupta and P. R. Kumar", 
  title =	 "Capacity of wireless networks", 
  text =	 "P. Gupta and P.R. Kumar. Capacity of wireless 
                  networks. Technical report, University of Illinois, 
                  Urbana-Champaign, 1999.", 
  year =	 1999, 
  url =		 {} 
} 
@InProceedings{GKG02, 
  author =	 {Indranil Gupta and Anne-Marie Kermarrec and Ayalvadi 
                  J. Ganesh}, 
  title =	 {Efficient Epidemic-style protocols for Reliable and 
                  Scalable Multicast}, 
  booktitle =	 {21st Symposium on Reliable Distributed Systems 
                  ({SRDS} 2002)}, 
  pages =	 {180--189}, 
  year =	 2002, 
  month =	 {Oct.}, 
  url = 
                  {\url{http://www.cs.cornell.edu/gupta/Papers/P106_gupta_i.pdf}} 
} 
@InProceedings{GKLP04, 
  author =	 {Aram Galstyan and Bhaskar Krishnamachari and 
                  Kristina Lerman and Sundeep Pattem}, 
  title =	 {Distributed Online Localization in Sensor Networks 
                  Using a Moving Target}, 
  crossref =	 {ipsn04}, 
  abstract =	 {We describe a novel method for node localization in 
                  a sensor network where there are a fraction of 
                  reference nodes with known locations. For 
                  application-specific sensor networks, we argue that 
                  it makes sense to treat localization through online 
                  distributed learning and integrate it with an 
                  application task such as target tracking. We propose 
                  distributed online algorithm in which sensor nodes 
                  use geometric constraints induced by both radio con- 
                  nectivity and sensing to decrease the uncertainty of 
                  their position. The sensing constraints, which are 
                  caused by a commonly sensed moving target, are 
                  usually tighter than connectivity based constraints 
                  and lead to a decrease in average localization error 
                  over time. Different sensing models, such as radial 
                  binary detection and distance-bound estimation, are 
                  considered. First, we demonstrate our approach by 
                  studying a simple scenario in which a moving beacon 
                  broadcasts its own coordinates to the nodes in its 
                  vicinity. We then generalize this to the case when 
                  instead of a beacon, there is a moving target with 
                  a-priori unknown coordinates. The algorithms 
                  presented are fully distributed and assume only 
                  local information exchange between neighboring 
                  nodes. Our results indicate that the proposed method 
                  can be used to significantly enhance the accuracy in 
                  position estimation, even when the fraction of 
                  reference nodes is small. We compare the efficiency of 
                  the distributed algorithms to the case when node 
                  positions are estimated using centralized (convex) 
                  programming. Finally, simulations using the 
                  TinyOS-Nido platform are used to study the 
                  performance in more realistic scenarios.} 
} 
@TechReport{GKWC+02, 
  author =	 {D. Ganesan and B. Krishnamachari and A. Woo and 
                  D. Culler and D. Estrin and S. Wicker}, 
  title =	 {Complex Behavior at Scale: An Experimental Study of 
                  Low-Power Wireless Sensor Networks}, 
  institution =	 {Computer Science Department, UCLA}, 
  year =	 2002, 
  number =	 {UCLA/CSD-TR 02-0013}, 
  month =	 Jul 
} 
@InProceedings{GLM01, 
  author =	 {P. Golle and K. Leyton-Brown and I. Mironov and Mark 
                  Lillibridge2}, 
  title =	 {Incentives for Sharing in Peer-to-Peer Networks}, 
  booktitle =	 {Proceedings of the 2001 {ACM} Conference on 
                  Electronic Commerce}, 
  year =	 2001, 
  abstract =	 {We consider the free-rider problem in peer-to-peer 
                  file sharing networks such as Napster: that 
                  individual users are provided with no incentive for 
                  adding value to the network. We examine the design 
                  implications of the assumption that users will 
                  selfishly act to maximize their own rewards, by 
                  constructing a formal game theoretic model of the 
                  system and analyzing equilibria of user strategies 
                  under several novel payment mechanisms. We support 
                  and extend this work with results from experiments 
                  with a multi-agent reinforcement learning model.}, 
  url = 
                  { 
\url{http://crypto.stanford.edu/\%7Epgolle/papers/peer.pdf}} 
} 
@InProceedings{GLMR+04, 
  author =	 {D. Goldenberg and Jie Lin and A.S. Morse and Brad 
                  Rosen and Y.R. Yang}, 
  title =	 {Towards Mobility as a Network Control Primitive}, 
  crossref =	 {mobihoc04} 
} 
@inproceedings{GM96, 
  author =	 "Goldberg and MacKenzie", 
  title =	 "Analysis of Practical Backoff Protocols for 
                  Contention Resolution with Multiple Servers", 
  booktitle =	 "{SODA}: {ACM}-{SIAM} Symposium on Discrete 
                  Algorithms (A Conference on Theoretical and 
                  Experimental Analysis of Discrete Algorithms)", 
  year =	 1996, 
  url =		 {} 
} 
@InProceedings{GM99, 
  author =	 {P. Gupta and N. McKeown}, 
  title =	 {Packet Classification on Multiple Fields}, 
  crossref =	 "sigcomm99", 
  pages =	 {147--160}, 
  year =	 1999, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/proceedings/comm/316188/p147-gupta/}} 
} 
@Article{GMA01, 
  author =	 {J.R. Gallardo and D. Makrakis and M. Angulo}, 
  title =	 {Dynamic resource management considering the real 
                  behavior of aggregate traffic}, 
  journal =	 itm, 
  year =	 2001, 
  month =	 Jun, 
  volume =	 3, 
  number =	 2, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19975/00923817.pdf?isNumber=19975}} 
} 
@InProceedings{GN94, 
  author =	 {Gong, Li and Shacham, Nachum}, 
  title =	 {Elements of Trusted Multicasting}, 
  crossref =	 "icnp94", 
  abstract =	 {The first paper to point out the need for some type 
                  of authentication and authorization mechanism for 
                  multicast. The goals they stated are a secure 
                  multicast protocol design should meet: compatibility 
                  with existing protocols, scalability to the scope of 
                  the global Internet, transparency to high-level 
                  protocols, localizability for gradual introduction 
                  of the technology and flexibility to support a 
                  variety of policies. } 
} 
@InProceedings{GR00, 
  author =	 {Katherine Guo and Injong Rhee}, 
  title =	 {Message Stability Detection for Reliable Multicast}, 
  crossref =	 "infocom00", 
  abstract =	 {RM} 
} 
@InProceedings{GRK99, 
  author =	 {Panos Gevros and Fulvio Risso and Peter Kirstein}, 
  title =	 {Analysis of a Method for Differential {TCP} Service}, 
  crossref =	 "globecom99", 
  abstract =	 {link at}, 
  url =		 { 
                  \url{http://www.cs.ucl.ac.uk/staff/p.gevros/gi99/gi99-paper.ps.gz}} 
} 
@InProceedings{GS00, 
  author =	 {Michel X. Goemans and Martin Skutella}, 
  title =	 {Cooperative Facility Location Games}, 
  booktitle =	 {Proceedings of Symposium on Discrete Algorithms 
                  ({SODA}) 2000}, 
  year =	 2000, 
  pages =	 {76--85}, 
  url = 
                  {} 
} 
@Article{GS00, 
  author =	 {Tyrone Grandison and Morris Sloman}, 
  title =	 {A Survey of Trust in {I}nternet Applications}, 
  journal =	 {{IEEE} Communications Surveys and Tutorials}, 
  year =	 2000, 
  volume =	 {Fourth Quarter}, 
  url =		 {} 
} 
@Article{GS69, 
  author =	 {K. Gabriel and R. Sokal}, 
  title =	 {A New Statistical APproach to Geographic Variation 
                  Analysis}, 
  journal =	 {Systematic Zoology}, 
  year =	 1969, 
  volume =	 18, 
  pages =	 {259--278} 
} 
@InProceedings{GS95, 
  author =	 {Gong, Li and Shacham, Nachum}, 
  title =	 {Trade-offs in Routing Private Multicast Traffic}, 
  crossref =	 "globecom95", 
  abstract =	 {do details} 
} 
@InProceedings{GS99, 
  author =	 {J. Golestani and K. Sabnani}, 
  title =	 {Fundamental Observations on Multicast Congestion 
                  Control in the {I}nternet}, 
  crossref =	 "infocom99", 
  year =	 {1999}, 
  abstract =	 {} 
} 
@Article{GSR99, 
  author =	 {David Goldschlag and Michael Reedy and Paul 
                  Syversony}, 
  title =	 {Onion Routing for Anonymous and Private {I}nternet 
                  Connections}, 
  journal =	 {Communications of the {ACM}}, 
  year =	 1999, 
  volume =	 42, 
  number =	 2, 
  month =	 Feb, 
  url = 
                  {http://www.onion-router.net/Publications/CACM-1999.pdf}, 
  annote =	 {location} 
} 
@InProceedings{GSWS+01, 
  author =	 {Sandeep Gupta and Loren Schwiebert and Jennifer 
                  Weinmann and Ayad Salhieh and Manish Kochal}, 
  title =	 {Research Challenges in Wireless Networks of 
                  Biomedical Sensors}, 
  crossref =	 "mobicom01", 
  abstract =	 {Implanted biomedical devices have the potential to 
                  revolutionize medicine. emphSmart sensors, which are 
                  obtained by combining sensing materials with 
                  integrated circuitry, are being considered for 
                  several biomedical applications such as a retina 
                  prosthesis. These devices require the capability to 
                  communicate with an external diagnostic computer 
                  system via a wireless interface. The limited power 
                  and computational capabilities of smart sensor based 
                  biological implants present research challenges in 
                  several aspects of wireless networking due to the 
                  need for having a bio-compatible, fault-tolerant, 
                  energy-efficient, and scalable design. Further, 
                  embedding these sensors in humans add additional 
                  requirements. For example, the wireless networking 
                  solutions should be ultra-safe and reliable, work 
                  trouble-free in different geographical locations 
                  (although implants are not expected to move; they 
                  shouldn't restrict movements of their human host), 
                  and require minimal maintenance. This necessitates 
                  application-specific solutions which are vastly 
                  different from traditional solutions. In this paper, 
                  we describe the challenges for wireless networking 
                  of human-embedded smart sensor arrays and our 
                  preliminary approach for wireless networking of a 
                  retina prosthesis. Our aim is to motivate vigorous 
                  research in this area by illustrating the need for 
                  more application-specific and novel approaches 
                  toward developing wireless networking solutions for 
                  human-embeddable smart sensors.}, 
  url = 
                  {\url{http://newslab.cs.wayne.edu/mobicom-camera-ready.pdf}} 
} 
@InProceedings{GT00:map, 
  author =	 {Ramesh Govindan and Hongsuda Tangmunarunkit } , 
  title =	 {{H}euristics for {I}nternet map discovery} , 
  crossref =	 {infocom00}, 
  volume =	 {3} , 
  year =	 2000 , 
  month =	 Mar, 
  url =		 {} 
} 
@InProceedings{GT00:mobcap, 
  author =	 {Matthias Grossglauser and David N. C. Tse}, 
  title =	 {Mobility Increases the Capacity of Ad-hoc Wireless 
                  Networks}, 
  crossref =	 "infocom00", 
  pages =	 "1360--1369", 
  year =	 2001, 
  abstract =	 {The capacity of ad-hoc wireless networks is 
                  constrained by the mutual interference of concurrent 
                  transmissions between nodes. We study a model of an 
                  ad-hoc network where n nodes communicate in random 
                  source-destination pairs. These nodes are assumed to 
                  be mobile. We examine the per-session throughput for 
                  applications with loose delay constraints, such that 
                  the topology changes over the time-scale of packet 
                  delivery. Under this assumption, the per-user 
                  throughput can increase dramatically when...}, 
  url =		 {} 
} 
@Article{GY95, 
  author =	 {P. Glasserman and D. D. Yao}, 
  title =	 {Stochastic vector difference equations with 
                  stationary coefficients}, 
  journal =	 {J. Appl. Prob.}, 
  year =	 1995, 
  volume =	 32, 
  pages =	 {851--866}, 
  abstract =	 {Show for $X_{n+1} = v X_n + a S_n$ has a stationary 
                  solution $X_n^* = \sum_{0}^{\infty} v^k S_{n-1-k}$ 
                  Moreover, if $X_0$ starts from an arbitrary value, 
                  it will converge almost sure to the above stationary 
                  distribution, i.e., $\lim_{n \rightarrow \infty} 
                  |X_n - X_n^*| = 0$ P - a.s. } 
} 
@InProceedings{Gar98, 
  author =	 {J. J. Garcia-Luna-Aceves}, 
  title =	 {Reversing the collision-avoidance handshake in 
                  wireless networks}, 
  crossref =	 {mobicom99}, 
  pages =	 {120--131}, 
  year =	 1999, 
  abstract =	 {receiver initiated}, 
  url =		 {} 
} 
@Book{Gib92, 
  author =	 {Robert Gibbons}, 
  title =	 {Game Theory for Applied Economists}, 
  publisher =	 {Princeton University Press}, 
  year =	 1992 
} 
@Unpublished{Gol00, 
  author =	 {Andrea Goldsmith}, 
  title =	 {Wireless Communications: Trends and Challenges}, 
  note =	 {Class notes}, 
  abstract =	 {} 
} 
@Book{Gol01, 
  author =	 {Oded Goldreich}, 
  title =	 {Foundations of Cryptography: Volume 1, Basic Tools}, 
  publisher =	 {Cambridge University Press}, 
  year =	 2001, 
  month =	 Aug 
} 
@Book{Gol04, 
  author =	 {Oded Goldreich}, 
  title =	 {Foundations of Cryptography: Volume 2, Basic 
                  Applications}, 
  publisher =	 {Cambridge University Press}, 
  year =	 2004, 
  month =	 May 
} 
@Article{Gre80, 
  author =	 {P. Green}, 
  title =	 {An Introduction to Network Architectures and 
                  Protocols}, 
  journal =	 toc, 
  year =	 1980, 
  volume =	 28, 
  number =	 4, 
  pages =	 {413--424}, 
  month =	 Apr 
} 
@Article{Gro73, 
  author =	 {T. Groves}, 
  title =	 {Incentives in Teams}, 
  journal =	 {Econometrica}, 
  year =	 1973, 
  volume =	 41, 
  pages =	 {617--663} 
} 
@InProceedings{Gro96, 
  author =	 {Matthias Grossglauser}, 
  title =	 {Optimal Deterministic Timeouts for Reliable Scalable 
                  Multicast}, 
  crossref =	 "infocom96", 
  abstract =	 {no details} 
} 
@article{HB01, 
  author =	 "Jeffrey Hightower and Gaetano Borriella", 
  title =	 "A Survey and Taxonomy of Location Systems for 
                  Ubiquitous Computing", 
  journal =	 "IEEE Computer", 
  volume =	 34, 
  number =	 8, 
  month =	 Aug, 
  pages =	 "57--66", 
  year =	 2001, 
  url = 
                  {} 
} 
@InProceedings{HBC02, 
  author =	 {J. P. Hubaux and L. Buttyan and S. Capkun}, 
  title =	 "The Quest for Security in Mobile Ad Hoc Networks", 
  address =	 "Long Beach, CA", 
  year =	 2001, 
  key =		 {incentive} 
} 
@Article{HBF00, 
  author =	 {C. M. Harris and P. H. Brill and M. J. Fischer}, 
  title =	 {Internet-Type Queues with Power-Tailed Internarrival 
                  Times and Computational Methods for their Analysis}, 
  journal =	 {{INFORMS} Journal on Computing}, 
  year =	 2000, 
  number =	 12, 
  pages =	 {261--271}, 
  url = 
                  {\url{http://www.mitretek.org/publications/telecommunications/heavytails/pdfs/paperfinal.pdf}} 
} 
@manual{HC99, 
  author =	 {Hardjono, T. and Cain, B.}, 
  title =	 {Simple Key Management Protocol for {PIM}, 
                  INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 Feb, 
  abstract =	 {Not very elegant} 
} 
@InProceedings{HC99, 
  author =	 {H. W. Holbrook and D. R. Cheriton}, 
  title =	 {{IP} Multicast Channels: {EXPRESS} Support for 
                  Large-Scale Single-Source Applications}, 
  crossref =	 {sigcomm99}, 
  year =	 1999, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm99/papers/session2-3.html}} 
} 
@InProceedings{HCB00, 
  author =	 {Wendi Rabiner Heinzelman and Anantha Chandrakasan 
                  and Hari Balakrishnan}, 
  title =	 {Energy-efficient Communication Protocols for 
                  Wireless Microsensor Networks}, 
  booktitle =	 {Proceedings of {Hawaiian} International Conference 
                  on Systems Science}, 
  year =	 2000, 
  month =	 Jan, 
  note =	 {LEACH}, 
  url =		 {\url{http://nms.lcs.mit.edu/papers/leach-hicss.html}} 
} 
@Article{HCB03, 
  author =	 {David L. Hu and Brian Chan and John W. M. Bush}, 
  title =	 {The hydrodynamics of water strider locomotion}, 
  journal =	 {Nature}, 
  year =	 2003, 
  volume =	 427, 
  number =	 7, 
  pages =	 {663--667}, 
  month =	 Aug 
} 
@manual{HCM98, 
  author =	 {Hardjono, Thomas and Cain, Brad and Monga, Inder}, 
  title =	 {Intradomain Group Key Management Protocol, 
                  INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 aug, 
  abstract =	 {Domain divided into a number of areas, Areas are 
                  administratively-scoped. Distinguish data group and 
                  control group. Each area has N control groups. A 
                  member in an area also joins one control 
                  group. There is a special control group: 
                  All-KD-group. One control group may serve multiple 
                  multicast (data) groups. There are two types of Key 
                  Distributors: Domain KD (DKD), and Area KD 
                  (AKD). Also there are various types of keys: 
                  Multicast Key for data group, Area-Group-Key for 
                  area control group, and All-KD-Key for special 
                  All-KD-Group. Area-Group-Key unique for each 
                  (multicast group, control-group) pair.} 
} 
@manual{HD99, 
  author =	 {Harkins, Dan and Doraswamy, Naganand}, 
  title =	 {Multicast Key Management Protocol ({MKMP}), 
                  INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 aug, 
  abstract =	 {Key owner sends announcements with list of 
                  (Photuris-like) cookies. Routers (network entities) 
                  are distributing keys. Messages sent with Router 
                  Alert (RA). At first, members get key from sender, 
                  but then as multicast (router) tree is formed, 
                  members get key from local distribution 
                  points. Basically a flood and prune mechanism. Those 
                  that are authorized } 
} 
@Misc{HF98, 
  author =	 {Mark Handley and Sally Floyd}, 
  title =	 {Strawman Specification for {TCP} Friendly (Reliable) 
                  Multicast Congestion Control ({TFMCC}), Working 
                  Draft}, 
  year =	 {1998}, 
  month =	 dec, 
  abstract =	 {} 
} 
@Article{HGLV01, 
  author =	 {J. P. Hubaux and Th. Gross and J. Y. {Le Boudec} and 
                  M. Vetterli}, 
  title =	 {Towards self-organized mobile ad hoc networks: the 
                  {T}erminodes project}, 
  journal =	 {IEEE Communications Magazine, }, 
  year =	 2001, 
  month =	 Jan, 
  url = {} 
} 
@Book{HGP00, 
  author =	 {Olivier Hersent and David Gurle and Jean-Pierre 
                  Petit}, 
  title =	 {{IP} Telephony: Packet-based multimedia 
                  communications systems}, 
  publisher =	 {Addison-Wesley}, 
  year =	 2000 
} 
@InProceedings{HH98, 
  author =	 {Hanle, C. and Hofmann, M.}, 
  title =	 {A Comparison of Reliable Multicast Protocols using 
                  the Network Simulator ns-2}, 
  booktitle =	 {IEEE Conference on Local Computer Networks (LCN)}, 
  year =	 {1998}, 
  month =	 oct, 
  address =	 {Boston, MA}, 
  abstract =	 {} 
} 
@manual{HH99:lkh, 
  author =	 {Harney, Hugh and Harder, Eric}, 
  title =	 {Logical Key Hierarchy Protocol, INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 Mar, 
  abstract =	 {There are two issues in secure multicast: secure the 
                  data in transmission; and management. There are many 
                  management issues associated with the securing of a 
                  multicast group, including: Key generation 
                  procedures, Key distribution to all group members, 
                  Commonly understood group mechanisms, and 
                  Orchestrated group actions. } 
} 
@manual{HH99:req, 
  author =	 {Harney, Hugh and Harder, Eric}, 
  title =	 {Multicast Security Management Protocol ({MSMP}) 
                  Requirements and Policy, INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 Mar, 
  abstract =	 {There are two issues in secure multicast: secure the 
                  data in transmission; and management. There are many 
                  management issues associated with the securing of a 
                  multicast group, including: Key generation 
                  procedures, Key distribution to all group members, 
                  Commonly understood group mechanisms, and 
                  Orchestrated group actions. } 
} 
@InProceedings{HHBS+03, 
  author =	 {T. He and C. Huang and B. Blum and J. Stankovic and 
                  T. Abdelzaher}, 
  title =	 {Range-Free Localization Schemes in Large Scale 
                  Sensor Networks}, 
  crossref =	 {mobicom03}, 
  pages =	 {81--95}, 
  year =	 {2003}, 
  url =		 {} 
} 
@inproceedings{HHSW+99, 
  author =	 "Andy Harter and Andy Hopper and Pete Steggles and 
                  Andy Ward and Paul Webster", 
  title =	 "The Anatomy of a Context-Aware Application", 
  booktitle =	 "Mobile Computing and Networking", 
  pages =	 "59--68", 
  year =	 1999, 
  url =		 {} 
} 
@InProceedings{HJ00, 
  author =	 {Yih-Chun Hu and David B. Johnson }, 
  title =	 {Caching Strategies in On-Demand Routing Protocols 
                  for Wireless Ad Hoc Networks}, 
  crossref =	 "mobicom00", 
  abstract =	 {An on-demand routing protocol for wireless ad hoc 
                  networks is one that searches for and attempts to 
                  discover a route to some destination node only when 
                  a sending node originates a data packet addressed to 
                  that node. In order to avoid the need for such a 
                  route discovery to be performed before each data 
                  packet sent, an on-demand routing protocol must 
                  cache routes previously discovered. Such caching, 
                  however, introduces the problem of proper strategies 
                  for managing the cache as nodes in the network move 
                  in and out of wireless transmission range of one 
                  another, possibly invalidating some cached routing 
                  information and producing additional overhead and 
                  dropped packets as some nodes attempt to use this 
                  information for packets that they send or 
                  forward. This paper presents an analysis of the 
                  effects of different design choices for this caching 
                  in on-demand routing protocols in wireless ad hoc 
                  networks, dividing the problem into choices of cache 
                  structure, cache capacity, and cache timeout. Our 
                  analysis is based on the Dynamic Source Routing 
                  protocol (DSR), which operates entirely 
                  on-demand. Using detailed simulations of wireless ad 
                  hoc networks of 50 mobile nodes, we studied a total 
                  of 10 different caching algorithms that utilized a 
                  range of design choices, and simulated each 
                  algorithm over a set of 50 different movement 
                  scenarios drawn from 5 different types of mobility 
                  patterns. We also define a set of new mobility 
                  metrics that allow accurate characterization of the 
                  relative difficulty that a given movement scenario 
                  presents to an ad hoc network routing protocol, and 
                  we analyze each mobility metric's ability to predict 
                  the actual difficulty in terms of routing overhead 
                  experienced by the routing protocol across all 
                  scenarios in our study. } 
} 
@Book{HJ95, 
  author =	 {R. Horn and C. R. Johnson}, 
  title =	 {Matrix Analysis}, 
  publisher =	 {Cambridge University Press}, 
  year =	 1995, 
  address =	 {New York. NY} 
} 
@InProceedings{HJP02, 
  author =	 {Yih-Chun Hu and David B. Johnson and Adrian Perrig}, 
  title =	 {{SEAD}: Secure Efficent Distance Vector Routing for 
                  Mobile Wireless Ad Hoc Networks}, 
  booktitle =	 {Proceedings of the 4th IEEE Workshop on Mobile 
                  Computing Systems and Applications ({WMCSA} 2002)}, 
  year =	 2002, 
  address =	 {Calicoon, NY}, 
  month =	 Jun, 
  url = 
                  {\url{http://www.monarch.cs.rice.edu/monarch-papers/wmcsa02.ps}} 
} 
@InProceedings{HL04, 
  author =	 {Jason I. Hong and James A. Landay}, 
  title =	 {An Architecture for Privacy-Sensitive Ubiquitous 
                  Computing}, 
  crossref =	 {mobisys04}, 
  url = 
                  {\url{http://www.cs.berkeley.edu/~jasonh/publications/mobisys2004-confab-final.pdf}}, 
  annote =	 {location} 
} 
@Article{HL86, 
  author =	 {Ting-Chao Hou and Victor O.K. Li}, 
  title =	 {Transmission Range Control in Multihop Packet Radio 
                  Networks}, 
  journal =	 {{IEEE} Transactions on Communications}, 
  year =	 1986, 
  volume =	 34, 
  number =	 1, 
  pages =	 {38--44}, 
  month =	 {Jan} 
} 
@InProceedings{HL87, 
  author =	 {M. T. Hsiao and A. Lazar}, 
  title =	 {A Game-Theoretic Approach to Decentralized Flow 
                  Control of Markovian Queue Networks}, 
  booktitle =	 {Performance}, 
  address =	 {Holland}, 
  year =	 {1987} 
} 
@Article{HL99, 
  author =	 {Z.J. Haas and B. Liang}, 
  title =	 {Ad hoc mobility management with uniform quorum 
                  systems}, 
  journal =	 {IEEE/ACM Transactions on Networking}, 
  year =	 1999, 
  volume =	 7, 
  pages =	 {228--240}, 
  annote =	 {location service; distributed database, update a 
                  quorum of location servers} 
} 
@InProceedings{HLBF01, 
  author =	 {Andrew Huang and Benjamin Ling and John Barton and 
                  Armando Fox}, 
  title =	 {Making Computers Disappear: Appliance Data Services}, 
  crossref =	 "mobicom01", 
  abstract =	 {Digital appliances designed to simplify everyday 
                  tasks are readily available to end consumers. For 
                  example, mobile users can retrieve Web content using 
                  handheld devices since content retrieval is 
                  well-supported by infrastructure services such as 
                  transformational proxies. However, the same type of 
                  support is lacking for input-centric devices, those 
                  that create content and allow users to share 
                  content. This lack of infrastructural support makes 
                  input-centric devices hard to use and less 
                  useful. The Appliance Data Services project seeks to 
                  explore a vision of an appliance computing world 
                  where users move data seamlessly among various 
                  devices. Based on this vision, we formulate three 
                  principles that guide the design of an architecture 
                  that helps realize this vision: bring devices to the 
                  forefront, minimize the number of device features, 
                  and place functionality in the network 
                  infrastructure. We evaluate our implementation of 
                  the ADS architecture based on these principles, and 
                  build applications using the ADS framework to 
                  evaluate the ease with which appliance computing 
                  applications can be built using the framework. We 
                  find that it is relatively simple to build and 
                  extend applications on ADS that make using digital 
                  devices easier, and results in the devices 
                  themselves becoming more useful.} 
} 
@Book{HLC97, 
  author =	 {B. Hofmann-Wellenhof and H. Lichtenegger and 
                  J. Collins}, 
  title =	 {Global Positioning System: Theory and Practice, 
                  Fourth Edition}, 
  publisher =	 {Springer-Verlag}, 
  annote =	 {GPS measures one-way delay; four variables, x, y, z 
                  and time difference from the receiver to the 
                  satilites (the receiver is always below the 
                  satillites)}, 
  year =	 1997 
} 
@InProceedings{HLGH+00, 
  author =	 {J. P. Hubaux and J. Y. {Le Boudec} and S. Giordano 
                  and M. Hamdi and L. Blazevic and L. Buttyan and 
                  M. Vojnovic}, 
  title =	 {Towards Mobile Ad-Hoc {WAN}s: {T}erminodes}, 
  booktitle =	 {Proceedings of the {IEEE} Wireless Communications 
                  and Networking Conference ({WCNC})}, 
  year =	 2000, 
  address =	 {Chicago, IL}, 
  month =	 Sep, 
  url =  {} 
} 
@Article{HLR95, 
  author =	 {J. Hastad and T. Leighton and B. Rogoff}, 
  title =	 {Analysis of backoff protocols for multiple access 
                  channels}, 
  journal =	 {{SIAM} Journal of Computing}, 
  year =	 1995, 
  month =	 Oct, 
  abstract =	 {}, 
  url =		 {\url{http://www.nada.kth.se/~johanh/ethernetanalysis.ps}} 
} 
@manual{HMAC:MD5, 
  author =	 {Madson, C. and Glenn, R.}, 
  title =	 {The Use of {HMAC}-MD5-96 within {ESP} and {AH}, 
                  INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 Feb 
} 
@manual{HMAC:SHA, 
  author =	 {Madson, C. and Glenn, R.}, 
  title =	 {The Use of {HMAC-SHA-1-96} within {ESP} and {AH}, 
                  INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 Feb 
} 
@manual{HMR97:arch, 
  author =	 {Harney, H. and Muckenhirn, C. and Rivers, T.}, 
  title =	 {Group Key Management Protocol Architecture, {RFC} 
                  2094}, 
  year =	 {1997}, 
  month =	 Jul, 
  abstract =	 {}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2094.htm}} 
} 
@manual{HMR97:spec, 
  author =	 {Harney, H. and Muckenhirn, C. and Rivers, T.}, 
  title =	 {Group Key Management Protocol Specification, {RFC} 
                  2093}, 
  year =	 {1997}, 
  month =	 Jul, 
  abstract =	 {}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2093.htm}} 
} 
@InProceedings{HMTG01, 
  author =	 {C. Hollot and V. Misra and D. Towsley and W. Gong}, 
  title =	 {A Control Theoretic Analysis of {RED}}, 
  crossref =	 {infocom01}, 
  year =	 2001, 
  url = 
                  {ftp://gaia.cs.umass.edu/pub/MisraInfocom01-RED-Control.pdf} 
} 
@InProceedings{HP98, 
  author =	 {Z. Haas and M. Pearlman}, 
  title =	 {The performance of query control schemes for the 
                  zone routing protocol}, 
  crossref =	 {sigcomm98}, 
  annote =	 {ZRP}, 
  url =		 {} 
} 
@TechReport{HPJ01, 
  author =	 {Yih-Chun Hu and Adrian Perrig and David B. Johnson}, 
  title =	 {Ariadne: A Secure On-Demand Routing Protocol for Ad 
                  Hoc Networks}, 
  institution =	 {Department of Computer Science, Rice University}, 
  year =	 2001, 
  number =	 {TR01-384}, 
  month =	 Dec, 
  url = 
                  {\url{http://www.monarch.cs.rice.edu/monarch-papers/ariadne.ps}} 
} 
@InProceedings{HS01:cell, 
  author =	 {Hung-Yun Hsieh and Raghupathy Sivakumar}, 
  title =	 {Performance Comparison of Cellular and Multi-hop 
                  Wireless Networks: A Quantitative Study}, 
  crossref =	 "sigmetrics01", 
  abstract =	 {In this paper we study the performance trade-offs 
                  between conventional cellular and multi-hop ad-hoc 
                  wireless networks. We compare through simulations 
                  the performance of the two network models in terms 
                  of raw network capacity, end-to-end throughput, 
                  end-to-end delay, power consumption, per-node 
                  fairness (for throughput, delay, and power), and 
                  impact of mobility on the network performance. The 
                  simulation results show that while ad-hoc networks 
                  perform better in terms of throughput, delay, and 
                  power, they suffer from unfairness and poor network 
                  performance in the event of mobility. We discuss the 
                  trade-offs involved in the performance of the two 
                  network models, identify the specific reasons behind 
                  them, and argue that the trade-offs preclude the 
                  adoption of either network model as a clear solution 
                  for future wireless communication systems. Finally, 
                  we present a simple hybrid wireless network model 
                  that has the combined advantages of cellular and 
                  ad-hoc wireless networks but does not suffer from 
                  the disadvantages of either.}, 
  url = 
                  {\url{http://www.ece.gatech.edu/research/GNAN/archive/sigmetrics01hs.pdf}} 
} 
@InProceedings{HS01:sp, 
  author =	 {J. Hershberger and S. Suri}, 
  title =	 {Vickrey Prices and Shortest Paths: What is an Edge 
                  Worth?}, 
  crossref =	 {focs01}, 
  pages =	 {252--259}, 
  year =	 2001, 
  url = 
                  {\url{http://www.cs.berkeley.edu/\verb$~$christos/games/readings/vickreypaths.ps}} 
} 
@InProceedings{HSC95, 
  author =	 {Hugh W. Holbrook and Sandeep K. Singhal and David 
                  R. Cheriton}, 
  title =	 {Log-Based Receiver-Reliable Multicast for 
                  Distributed Interactive Simulation}, 
  crossref =	 "sigcomm95", 
  abstract =	 {Tree} 
} 
@InProceedings{HSWH+00, 
  author =	 {Jason Hill and Robert Szewczyk and Alec Woo and Seth 
                  Hollar and David Culler and Kristofer Pister}, 
  title =	 {System Architecture Directions for Network Sensors}, 
  booktitle =	 {{ASPLOS}}, 
  year =	 2000, 
  url =		 {\url{http://www.tinyos.net/papers/tos.pdf}} 
} 
@article{HT73, 
  author =	 {J.E. Hopcroft and R.E. Tarjan}, 
  title =	 {Dividing a Graph into Triconnected Components}, 
  journal =	 {SIAM J. Comput.}, 
  year =	 1973, 
  volume =	 3, 
  pages =	 {135--158}, 
} 
@InProceedings{HVB01, 
  author =	 {Gavin Holland and Nitin Vaidya and Paramvir 
                  Victor Bahl}, 
  title =	 {A Rate-Adaptive MAC Protocol For Wireless Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {Wireless local area networks are becoming 
                  increasingly popular, due, in part, to the recent 
                  availability of devices capable of communicating at 
                  high data rates. These high rates are made possible, 
                  in part, through new modulation techniques that 
                  dramatically increase bandwidth efficiency. However, 
                  the appropriate modulation scheme is a function of 
                  the channel conditions. Consequently, wireless 
                  devices often support multiple data rates utilizing 
                  multiple modulation schemes, and provide users the 
                  ability to manually choose the desired rate. A rate 
                  adaption mechanism may also be employed, which 
                  automatically selects the rate that gives the 
                  optimum throughput for the channel 
                  conditions. Although rate adaption techniques for 
                  cellular wireless networks have been studied at 
                  length, few have been proposed for wireless local 
                  area networks. This paper presents one such 
                  mechanism: a rate adaptive MAC protocol based on the 
                  RTS/CTS protocol, called the Receiver-Based AutoRate 
                  (RBAR) protocol. In RBAR, the rate adaption 
                  mechanism is located on the receiver, instead of on 
                  the sender (as is the case in current devices like 
                  the WaveLAN~II. This configuration is better because 
                  it allows the rate adaption mechanism to acquire 
                  channel quality information directly from the 
                  receiver's hardware, resulting in more efficient 
                  channel quality estimation. Simulation results of an 
                  implementation of RBAR into IEEE~802.11 show that 
                  this arrangement performs well.} 
} 
@InProceedings{HW00, 
  author =	 {Tilo Hamann and Jean Walrand}, 
  title =	 {A New Fair Window Algorithm for {ECN} Capable {TCP} 
                  (New-ECN)}, 
  crossref =	 "infocom00", 
  abstract =	 {ECN} 
} 
@manual{HW99, 
  author =	 {Hardjono, T. and Whetten, Brian}, 
  title =	 {Security Requirements for {RMTP-II}, INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 May, 
  abstract =	 {MY OPION: All Control Nodes in an infrastructure in 
                  one group because one control node maybe in more 
                  than one group, and the security association for 
                  them can be high. A DR and its receivers form 
                  authentication group. ALSO, maybe modifying IPSec to 
                  deliver authenticating keys to all members, and 
                  encryption key to only receivers. } 
} 
@Article{HWK04, 
  author =	 {Q. He and D. Wu and P. Khosla}, 
  title =	 {Quest for Personal Control over Mobile Location 
                  Privacy}, 
  journal =	 {IEEE Communications Magazine}, 
  year =	 2004, 
  volume =	 42, 
  number =	 5, 
  pages =	 {130--136}, 
  month =	 May, 
  url = 
                  {\url{http://www.wu.ece.ufl.edu/mypapers/IEEE_COM_MAG_location.pdf}}, 
  annote =	 {location} 
} 
@TechReport{Han97, 
  author =	 {M. Handley}, 
  title =	 {An Examination of {MBone} Performance}, 
  institution =	 {USC/ISI}, 
  year =	 1997, 
  key =		 {ISI/RR-97-450}, 
  month =	 Jan, 
  abstract =	 {Use two state Markovian model, i.e. Gilbert model} 
} 
@article{Har95, 
  author =	 {L. Harn}, 
  title =	 {Efficient sharing (broadcasting) of multiple 
                  secrets}, 
  journal =	 {IEE proceedings. Computer and digital techniques}, 
  year =	 1995, 
  volume =	 142, 
  number =	 3, 
  pages =	 {237--240}, 
  month =	 May 
} 
@manual{Har98, 
  author =	 {Thomas Hardjono}, 
  title =	 {Multicast Security Framework, INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 aug, 
  abstract =	 {A single Internet wide Group Key Management (GKM) 
                  protocol is difficult. The design requirements are 
                  scalability, routing independent, and business 
                  requirement. The author propose to divide problem of 
                  multicast security into regions: intRA region, 
                  intER-region. The approach is analogous to routing 
                  protocols and therefore needs a simple framework & 
                  interoperability rules for multiple solutions. They 
                  propose a single trunk region (a logical unit: an 
                  AS), and one or more leaf regions. The boundary is 
                  demarcated by key manager (KM) entities. The trunk 
                  region has no member hosts (only KM 
                  entities). Member hosts exist in leaf region, and 
                  are associated with (at least) one KM Key Mgmnt 
                  zones. Each region has different keys.} 
} 
@book{Hen11, 
  author =	 {L. Henneberg}, 
  title =	 {Die Graphische Statik der starren Systeme}, 
  publisher =	 {Johnson Reprint}, 
  year =	 1911, 
} 
@Article{Hen92, 
  author =	 {Bruce Hendrickson}, 
  title =	 {Conditions for Unique Graph Realizations}, 
  journal =	 {{SIAM} Journal on Computing}, 
  year =	 1992, 
  volume =	 21, 
  number =	 1, 
  pages =	 {65--84}, 
  url = 
                  {\url{ftp://ftp.cs.sandia.gov/pub/papers/bahendr/nec.ps.gz}} 
} 
@Article{Hen95, 
  author =	 {Bruce Hendrickson}, 
  title =	 {The Molecule Problem: Exploiting Structure in Global 
                  Optimization}, 
  journal =	 {{SIAM} Journal on Optimization}, 
  year =	 1995, 
  volume =	 5, 
  number =	 4, 
  pages =	 {835--857}, 
  annote =	 {decompose into globally rigid subgraphs and then 
                  solve each problem through optimization}, 
  url = 
                  {\url{ftp://ftp.cs.sandia.gov/pub/papers/bahendr/mol.ps.gz}} 
} 
@Article{Hin96, 
  author =	 {R. Hinden}, 
  title =	 {{IP} Next Generation Overview}, 
  journal =	 cacm, 
  year =	 1996, 
  volume =	 39, 
  number =	 6, 
  pages =	 {61--71}, 
  month =	 Jun, 
  abstract =	 {Discussion of IPv6.}, 
  url = 
                  {\url{http://playground.sun.com/pub/ipng/html/INET-IPng-Paper.html}} 
} 
@InProceedings{Hoe96, 
  author =	 {J.C. Hoe}, 
  title =	 {Improving the Start-up Behavior of a Congestion 
                  Control Scheme for {TCP}}, 
  crossref =	 "sigcomm96", 
  year =	 1996, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/proceedings/comm/248156/p270-hoe/}} 
} 
@InProceedings{Hof97, 
  author =	 {Markus Hofmann}, 
  title =	 {Enabling Group Communication in Global Networks}, 
  booktitle =	 {Global Networking'97}, 
  year =	 {1997}, 
  month =	 jun, 
  address =	 {Alberta, Canada}, 
  abstract =	 {propose LGMP} 
} 
@InProceedings{KLS01, 
  author =	 {M. Kearns and M. Littman and S. Singh}, 
  title =	 {Graphical Models for Game Theory}, 
  booktitle =	 {Proceedings of {UAI}}, 
  url = 
                  {\url{http://www.cis.upenn.edu/~mkearns/papers/graphgames.pdf}}, 
  year =	 2001 
} 
@Article{Hsi01, 
  author =	 {P. Hsiao}, 
  title =	 {Geographic Region Summary Service for Geographical 
                  Routing}, 
  journal =	 {ACM Mobile Computing and Communication Review}, 
  year =	 2001, 
  pages =	 {25--39}, 
  month =	 Oct, 
  annote =	 {GRSS; hash function; location service; bloom filter} 
} 
@Article{Hu93, 
  author =	 {L. Hu}, 
  title =	 {Topology Control for Multihop Packet Radio Networks}, 
  journal =	 {{IEEE} Transactions on Communications}, 
  year =	 1993, 
  volume =	 41, 
  pages =	 {1474--1481}, 
  month =	 Oct, 
  annote =	 {Describes a distributed, Delaunay 
                  triangulation-based algorithm for choosing logical 
                  links and as a consequence carrying out topology 
                  control. In choosing these links he follows a few 
                  heuristic guidelines such as not exceeding an upper 
                  bound on the degree of each node and choosing links 
                  that create a regular and uniform graph 
                  structure. He does not take advantage of adaptive. }, 
  url =		 {} 
} 
@Article{Hur73, 
  author =	 {Leo Hurwicz}, 
  title =	 {The design of mechanisms for resource allocation}, 
  journal =	 {American Economic Review Papers and Proceedings}, 
  year =	 1973, 
  number =	 63, 
  pages =	 {1--30}, 
  note =	 {First study on mechanism design} 
} 
@InProceedings{IGE00, 
  author =	 {Chalermek Intanagonwiwat and Ramesh Govindan and 
                  Deborah Estrin}, 
  title =	 {Directed Diffusion: A Scalable and Robust 
                  Communication Paradigm for Sensor Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {Advances in processor, memory and radio technology 
                  will enable small and cheap nodes capable of 
                  sensing, communication and computation. Networks of 
                  such nodes can coordinate to perform distributed 
                  sensing of environmental phenomena. In this paper, 
                  we explore the directed diffusion paradigm for such 
                  coordination. Directed diffusion is data-centric in 
                  that all communication is for named data. All nodes 
                  in a directed diffusion-based network are 
                  application-aware. This enables diffusion to achieve 
                  energy savings by selecting empirically good paths 
                  and by caching and processing data in-network. We 
                  explore and evaluate the use of directed diffusion 
                  for a simple remote-surveillance sensor network. }, 
  url =		 {\url{http://www.isi.edu/scadds/projects/diffusion.html}} 
} 
@Misc{IPMA, 
  key =		 {IPMA: Internet Performance Measurement and Analysis}, 
  author =	 {{IPMA}: Internet Performance Measurement and 
                  Analysis}, 
  howpublished = {\url{http://www.merit.edu/ipma/}} 
} 
@Misc{IPTEL-trend00, 
  author =	 {3com white paper}, 
  title =	 {The Architectural Impact of {IP} Telephony on Packet 
                  Network Infrastructures }, 
  howpublished = {URL: 
                  \url{http://www.3com.com/technology/tech_net/white_papers/503045.html}}, 
  year =	 2000, 
  annote =	 {Shows the following requirements: (1) Mediation or 
                  gateway services between the PSTN and the IP network 
                  for transparent internetworking (2) A high degree of 
                  scalability--the ability to affordably add 
                  processing and switching power as networks expand 
                  (3) The deployment of new and enhanced services 
                  (enabled by placing intelligence at the edges of 
                  the network, where media convergence occurs) (4) 
                  Multiple services over a common infrastructure (5) 
                  Automated and integrated management functions (6) 
                  The ability to mix and match best-of-breed equipment 
                  and software from different vendors. And the delay 
                  and loss requirements are summarized as follows: 
                  Voice quality is significantly impacted by one-way 
                  network delays of anywhere between 100 and 200 
                  milliseconds (ms), depending on the tolerance level 
                  of the individual. Contributors to delay include 
                  normal processing in a network, the distance between 
                  two communicating points, network congestion, and 
                  packet loss and retransmission delays. To 
                  successfully deploy toll-quality voice services over 
                  packet infrastructures, ^^^^^^^^^^^^^service 
                  providers must engineer their networks in a way that 
                  ensures that latency does not exceed the 200 ms 
                  end-to-end, one-way maximum. To accommodate a wider 
                  scope of users, keeping latency below 100 ms is 
                  preferable. Packet loss should remain under 3 
                  percent, with 1 percent packet discard preferable. } 
} 
@Misc{ISIS, 
  key =		 "ISIS", 
  title =	 {{IS-IS} for {IP} {I}nternets ({IS-IS})}, 
  howpublished = {\url{http://www.ietf.org/html.charters/isis-charter.html}} 
} 
@Misc{LookingGlass, 
  key =		 {Looking Glass}, 
  author =	 {{Looking Glass servers}}, 
  howpublished = {\url{http://www.traceroute.org}} 
} 
@Misc{Internap, 
  key =		 {Internap Networks, Inc.}, 
  author =	 {{Internap Networks, Inc.}}, 
  howpublished = {\url{http://www.internap.com}} 
} 
@Misc{cisco-OER, 
  key =		 {Optimized Edge Routing}, 
  author =	 {{Cisco, Inc.}}, 
  howpublished = {\url{http://www.cisco.com/go/oer/}} 
} 
@Misc{cisco-OER-probe, 
  key =		 {Optimized Edge Routing Probing}, 
  author =	 {{Cisco, Inc.}}, 
  howpublished = {\url{http://www.cisco.com/application/pdf/en/us/guest/products/ps6628/c1161/cdccont_0900aecd803155a8.pdf}} 
} 
@InProceedings{JAZ00, 
  author =	 {Tianji Jiang and Mostafa H. Ammar and Ellen 
                  W. Zegura}, 
  title =	 {On the Use of Destination Set Grouping to Improve 
                  Inter-receiver Fairness for Multicast {ABR} 
                  Sessions}, 
  crossref =	 "infocom00", 
  abstract =	 {Propose to use 3 heuristics to partition receivers 
                  according to receiver multirate maxmin 
                  rates. However, the setup is for ATM, and replicated 
                  (not layer) multicast. } 
} 
@InProceedings{JAZ98, 
  author =	 {Tianji Jiang and Mostafa H. Ammar and Ellen 
                  W. Zegura}, 
  title =	 {Inter-Receiver Fairness: A Novel Performance Measure 
                  for Multicast {ABR} Sessions}, 
  booktitle =	 {Proceedings of ACM SIGMETRICS '98}, 
  year =	 1998, 
  month =	 jun, 
  abstract =	 {The base case of our approach. Single group, 
                  ATM. Defined IRF (Inter-Receiver Fairness), Isolated 
                  rate of a receiver. ZXC: consider two groups, B-grp 
                  and V-grp, and if the receiver still experience loss 
                  in V-grp, then it will leave the whole session. The 
                  paper defines a fairness function, and the goal is 
                  to maximized the function. } 
} 
@InProceedings{JB00, 
  author =	 {Enrico Jugl and Holger Boche}, 
  title =	 {Analysis of Analytical Mobility Models with Respect 
                  to the Applicability for Handover Modeling and to 
                  the Estimation of Signaling Cost}, 
  crossref =	 "mobicom00", 
  abstract =	 {This paper analyzes two analytical mobility models 
                  for their suitability to handover modeling and to 
                  the estimation of signaling cost. Some 
                  insufficiencies of the often employed Hong/Rappaport 
                  model are detected. Here, an infinite mean dwell 
                  time occurs which is not suitable for performance 
                  evaluation of mobile communications 
                  systems. Therefore, handover modeling is not 
                  possible. To prevent infinite dwell times, an 
                  universal condition for the velocity distribution is 
                  derived. The biased sampling formula of the velocity 
                  distribution fulfills our universal 
                  condition. Finally, the consequences of the biased 
                  sampling of the velocity for the signaling traffic 
                  are discussed for the modified Hong/Rappaport model 
                  and a highway model. In contrast to the analytical 
                  calculations without consideration of biased 
                  sampling, we detect a significant increase of 
                  signaling traffic. It is shown that the probability 
                  density function of the velocity of the 
                  boundary-crossing subscribers is given by the biased 
                  sampling formula. Thus, for handover modeling and 
                  the exact estimation of signaling traffic the biased 
                  sampling formula of the velocity has to be taken 
                  into account in analytical calculations in any 
                  case. } 
} 
@InProceedings{JBAS03, 
  title =	 {Towards Realistic Mobility Models for Mobile Ad hoc 
                  Networks}, 
  author =	 {Amit Jardosh and Elizabeth Belding-Royer and Kevin 
                  Almeroth and Subhash Suri}, 
  crossref =	 {mobicom03} 
} 
@Article{JC97, 
  author =	 {A. J. Goldsmith and S. G. Chua}, 
  title =	 {Variable-rate variable-power {M-QAM} for fading 
                  channel}, 
  journal =	 {IEEE Transactions on Communications}, 
  year =	 1997, 
  volume =	 45, 
  pages =	 {1218--1230}, 
  month =	 Oct 
} 
@InProceedings{JE96, 
  author =	 {Stephen Jacobs and Alexandros Eleftheriadis}, 
  title =	 {Providing video services over networks without 
                  quality of service guarantees}, 
  booktitle =	 {Proceedings of World Wide Web Consortium Workshop on 
                  Real-time Multimedia and the Web}, 
  year =	 1996, 
  month =	 oct, 
  abstract =	 {AIMD} 
} 
@InProceedings{JGJK+00, 
  author =	 {John Jannotti and David K. Gifford and Kirk 
                  L. Johnson and M. Frans Kaashoek and James 
                  W. O'Toole Jr.}, 
  title =	 {Overcast: Reliable Multicasting with an Overlay 
                  Network}, 
  crossref =	 {osdi00}, 
  url =		 {\url{http://www.usenix.org/events/osdi2000/jannotti.html}} 
} 
@Article{JH97, 
  author =	 {Don Jacobs and Bruce Hendrickson}, 
  title =	 {An Algorithm for Two Dimensional Rigidity 
                  Percolation: The Pebble Game}, 
  journal =	 {J. Computational Physics}, 
  year =	 1997, 
  volume =	 137, 
  number =	 2, 
  pages =	 {346--365}, 
  annote =	 {change the concept of matching to pebble game. Maybe 
                  easier to be implemented in a distributed setting.}, 
  url = 
                  {\url{ftp://ftp.cs.sandia.gov/pub/papers/bahendr/percolate.ps.gz}} 
} 
@InProceedings{JHB03, 
  author =	 {Markus Jakobsson and J. P. Hubaux and L. Buttyan}, 
  title =	 {A Micropayment Scheme Encouraging Collaboration in 
                  Multi-Hop Cellular Networks}, 
  booktitle =	 {Proceedings of Financial Crypto 2003}, 
  year =	 2003, 
  address =	 {La Guadeloupe}, 
  month =	 Jan, 
  url = 
                  {\url{http://lcawww.epfl.ch/Publications/hubaux/JakobssonHB03.pdf}}, 
  abstract =	 {We propose a micro-payment scheme for multi-hop 
                  cellular networks that encourages collaboration in 
                  packet forwarding by letting users benefit from 
                  relaying others` packets. At the same time as 
                  proposing mechanisms for detecting and rewarding 
                  collaboration, we introduce appropriate mechanisms 
                  for detecting and punishing various forms of 
                  abuse. We show that the resulting scheme -- which is 
                  exceptionally light-weight -- makes collaboration 
                  rational and cheating undesirable.} 
} 
@TechReport{JJ03, 
  author =	 {Bill Jackson and Tibor Jord{\`a}n }, 
  title =	 {Connected rigidity matroids and unique realizations 
                  of graphs}, 
  institution =	 {Eotvos University}, 
  year =	 2003, 
  number =	 {TR-2002-12}, 
  address =	 {Budapest, Hungary}, 
  month =	 {Mar.}, 
  annote =	 {6-connectivity implies global rigidity}, 
  url = 
                  {\url{http://www.cs.elte.hu/egres/design/generated/pub_techrep29.html}} 
} 
@InProceedings{JK88, 
  author =	 {Van Jacobson and M. Karels}, 
  title =	 {Congestion avoidance and control}, 
  crossref =	 "sigcomm88", 
  abstract =	 {Also see \cite{Jac90}. Propose to add variance in 
                  delay estimation algorithm of TCP. Propose slow 
                  start, fast retransmit, and use AIMD for window size 
                  adjustment.}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/ccr/archive/1995/jan95/ccr-9501-jacobson.html}} 
} 
@InProceedings{JK97, 
  author =	 "Zhimei Jiang and Leonard Kleinrock", 
  title =	 "Prefetching Links on the {WWW}", 
  booktitle =	 "Proceedings of {ICC}", 
  pages =	 "483--489", 
  year =	 1997, 
  url =		 {} 
} 
@InProceedings{JKPS00, 
  author =	 {Niranjan S. Joshi and Srinivas R. Kadaba and Sarvar 
                  Patel and Ganapathy S. Sundaram}, 
  title =	 {Microwaves and Coffee Cups or Downlink Scheduling in 
                  CDMA Data Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {Packet data is expected to dominate third generation 
                  wireless networks, unlike current generation voice 
                  networks. This opens up new and interesting 
                  problems. Physical and link layer issues have been 
                  studied extensively and standardized. On the other 
                  hand, resource allocation and scheduling issues have 
                  not been addressed satisfactorily. In this work, we 
                  address resource management on the downlink of CDMA 
                  packet data networks. Network performance (for 
                  example, capacity) has been addressed, but user 
                  centric performance has not received much 
                  attention. Recently, various non-traditional 
                  scheduling schemes based on new metrics have been 
                  proposed, and target user performance (mostly 
                  without reference to wireless). We adapt these 
                  metrics to the CDMA context, and establish some new 
                  results for the offline scheduling problem. In 
                  addition, we modify a large class of online 
                  algorithms to work in our setup and conduct a wide 
                  range of experiments. Based on detailed simulations, 
                  we infer that: 1. Algorithms which exploit ``request 
                  sizes'' seem to outperform those that do not. Among 
                  these, algorithms that also exploit channel 
                  conditions provide significantly higher network 
                  throughput. 2. Depending on continuous or 
                  discretized bandwidth conditions, either pure time 
                  multiplexing or a combination of time and code 
                  multiplexing strikes an excellent balance between 
                  user satisfaction and network 
                  performance. 3. Discrete bandwidth conditions can 
                  lead to degraded user level performance without much 
                  impact on network peformance. We argue that the 
                  discretization can be tuned to address this 
                  shortcoming. } 
} 
@InProceedings{JLHM+99, 
  author =	 {P. Johansson and T. Larsson and N. Hedman and 
                  B. Mielczarek and M. Degermark}, 
  title =	 {Scenario-based performance analysis of routing 
                  protocols for mobile ad-hoc networks}, 
  crossref =	 {mobicom99}, 
  pages =	 {195--206}, 
  year =	 1999, 
  url =		 {} 
} 
@Article{JLM01, 
  author =	 {A. Jadbabaie and J. Lin and A.S. Morse}, 
  title =	 {Coordination of Groups of Autonomous Mobile Agents 
                  Using Nearest Neighbor Rules}, 
  journal =	 {{IEEE} Transaction on Automatic Control}, 
  volume =	 48, 
  number =	 6, 
  pages =	 {988--1001}, 
  year =	 2003 
} 
@InCollection{JM96, 
  author =	 {D. B. Johnson and D. A. Malt}, 
  booktitle =	 {Mobile Computing}, 
  title =	 {Dynamic Source Routing in {A}d {H}oc Wireless 
                  Networks}, 
  editor =	 {Tomasz Imielinski and Hank Korth}, 
  publisher =	 {Kluwer Academic Publishers}, 
  year =	 1996, 
  url = 
                  {\url{http://www.monarch.cs.cmu.edu/monarch-papers/kluwer-adhoc.ps}} 
} 
@InProceedings{GKMY+05, 
  author =	 {D. Goldenberg and A. Krishnamurthy and W.C. Maness 
                  and Y. R. Yang and A. Young and A. S. Morse and 
                  A. Savvides and B.D.O. Anderson}, 
  title =	 {Network Localization in Partially Localizable 
                  Networks}, 
  crossref =	 {infocom05} 
} 
@Article{JPS01, 
  author =	 {R. Jain and A. Puri and R. Sengupta}, 
  title =	 {Geographical Routing Using Partial Information for 
                  Wireless Ad Hoc Networks}, 
  journal =	 {Personal Communications}, 
  year =	 2001, 
  pages =	 {48--57}, 
  month =	 Feb, 
  annote =	 {GRA}, 
  url =		 {} 
} 
@TechReport{JRC87, 
  author =	 {Raj Jain and K. K. Ramakrishnan and Dah-Ming Chiu}, 
  title =	 {Congestion Avoidance in Computer Networks with a 
                  Connectionless Network Layer}, 
  institution =	 {DEC}, 
  year =	 1987, 
  number =	 {DEC--TR--506}, 
  month =	 aug, 
  url =		 {}, 
  annote =	 {Specifies both router policies and user policies for 
                  congestion avoidance (not congestion 
                  control). Routers calculate average queue length at 
                  regeneration cycle.} 
} 
@InProceedings{JRS03, 
  author =	 {Ari Juels and Ronald L. Rivest and Michael Szydlo}, 
  title =	 {The Blocker Tag: Selective Blocking of {RFID} Tags 
                  for Consumer Privacy}, 
  booktitle =	 {Proceedings of the 4th {ACM} Conference on Computer 
                  and Communications Security}, 
  year =	 2003, 
  annote =	 {location} 
} 
@InProceedings{JS00:delayloss, 
  author =	 {Wenyu Jiang and Henning Schulzrinne } , 
  title =	 {{M}odeling of packet loss and delay and their effect 
                  on real-time multimedia service quality} , 
  booktitle =	 {Proceedings of the 10th International Workshop on 
                  Network and Operating System Support for Digital 
                  Audio} , 
  year =	 2000 , 
  month =	 jun 
} 
@InProceedings{JS00:onoff, 
  author =	 {Wenyu Jiang and Henning Schulzrinne } , 
  title =	 {{A}nalysis of on-off patterns in {V}o{I}{P} and 
                  their effect on voice traffic aggregation} , 
  booktitle =	 {Proceedings of the 9th International Conference on 
                  Computer Communications and Networks} , 
  year =	 2000 , 
  month =	 oct 
} 
@Article{JSAC01, 
  author =	 {C. Jones and K. Sivalingam and P. Agrawal and 
                  J. Chen}, 
  title =	 {A Survey of Energy Efficient Network Protocols for 
                  Wireless Networks }, 
  journal =	 {{ACM} Wireless Networks}, 
  year =	 2001, 
  volume =	 7, 
  number =	 4, 
  pages =	 {343--358}, 
  url =		 {} 
} 
@Article{JT01, 
  author =	 {R. Johari and D. Tan}, 
  title =	 {End-to-end congestion control for the {I}nternet: 
                  delays and stability }, 
  journal =	 {ton}, 
  year =	 2001, 
  url =		 {\url{http://web.mit.edu/~rjohari/www/}} 
} 
@Unpublished{JT03:cong, 
  author =	 {R. Johari and J. N. Tsitsiklis}, 
  title =	 {Network Resource Allocation and a Congestion Game}, 
  note =	 {Available at: \url{http://web.mit.edu/jnt/www/publ.html}}, 
  month =	 Apr, 
  year =	 2003, 
  url =		 {\url{http://web.mit.edu/jnt/www/publ.html}} 
} 
@Unpublished{JT03:routing, 
  author =	 {R. Johari and J. N. Tsitsiklis}, 
  title =	 {Routing and Peering in a Competitive {I}nternet}, 
  note =	 {Available at: \url{http://web.mit.edu/jnt/www/publ.html}}, 
  month =	 Jan, 
  year =	 2003, 
  abstract =	 {Linear network; NP-completeness; early exiting, or 
                  hot potato routing, check the UWash paper in Sigcomm 
                  2003}, 
  url =		 {\url{http://web.mit.edu/jnt/www/publ.html}} 
} 
@article{JT92, 
  author =	 "J. W. Jaromczyk and G. T. Toussaint", 
  title =	 "Relative Neighborhood Graphs And Their Relatives", 
  journal =	 "Proceedings of {IEEE}", 
  volume =	 80, 
  pages =	 "1502--1517", 
  year =	 1992, 
  url =		 {} 
} 
@InProceedings{JV01, 
  author =	 {Kamal Jain and Vijay V. Vazirani}, 
  title =	 {Applications of Approximation Algorithms to 
                  Cooperative Game}, 
  crossref =	 {stoc01}, 
  year =	 2001, 
  pages =	 {364--372}, 
  url = 
                  {} 
} 
@InProceedings{JVP00, 
  author =	 {Jan Janssen and Danny De Vleeschauwer and Guido 
                  H. Petit}, 
  title =	 {Delay and distortion bounds for packetized voice 
                  calls of traditional {PSTN} quality}, 
  booktitle =	 {Proceedings of the 1st IP-Telephony Workshop}, 
  year =	 2000, 
  month =	 Apr 
} 
@InProceedings{JZA99, 
  author =	 {Tianji Jiang and Ellen W. Zegura and Mostafa 
                  H. Ammar}, 
  title =	 {Inter-Receiver Fair Multicast Communication Over the 
                  {I}nternet}, 
  crossref =	 "nossdav99", 
  abstract =	 {Extend [JAZ98] to 2 group case} 
} 
@Misc{Jac00a, 
  author =	 {Van Jacobson}, 
  title =	 {Optics and the Internet: Problems, Non-problems and 
                  Hype}, 
  howpublished = {Keynote speech, ICNP 2000, Osaka, Japan}, 
  month =	 Nov, 
  year =	 2000 
} 
@Unpublished{Jac90, 
  author =	 {V. Jacobson}, 
  title =	 {Modified {TCP} Congestion Avoidance Algorithm}, 
  annote =	 {Note sent to end2end-interest mailing list}, 
  year =	 1990, 
  month =	 Apr, 
  url =		 {ftp://ftp.ee.lbl.gov/email/vanj.90apr30.txt}, 
  abstract =	 {Revision to \cite{Jac88}. Add fast retransmit and 
                  fast recovery.} 
} 
@misc{Jac93, 
  author =	 {Van Jacobson}, 
  title =	 {Lightweight Sessions --- A new architecture for 
                  realtime applications and protocols}, 
  howpublished = {3rd Annual Principal Investigators Meeting, ARPA, 
                  Santa Rosa, CA}, 
  month =	 Sep, 
  year =	 1993 
} 
@Article{Jaf81, 
  author =	 {J. M. Jaffe}, 
  title =	 {Bottleneck Flow Control}, 
  journal =	 toc, 
  year =	 1981, 
  volume =	 29, 
  pages =	 {954--962}, 
  abstract =	 {Initial proposal of maxmin fairness.} 
} 
@Misc{Jai00, 
  author =	 {Raj Jain}, 
  title =	 {Current Issues in Telecom Networks: {QoS}, Traffic 
                  Engineering and {DWDM}}, 
  howpublished = {Keynote speech, 2000 Summer Computer Simulation 
                  Conference ({SCSC} 2000) and 2000 Symposium on 
                  Performance Evaluation of Computer and 
                  Telecommunication Systems ({SPECTS} 2000), 
                  Vancouver, Canada}, 
  month =	 Jul, 
  year =	 2000 
} 
@TechReport{Jai90, 
  author =	 {R. Jain}, 
  title =	 {Myths about Congestion Management in High-Speed 
                  Networks}, 
  institution =	 {DEC}, 
  year =	 1990, 
  type =	 {DEC-TR-726}, 
  month =	 Oct, 
  annote =	 {Compare (by arguments) window control vs. rate 
                  control, open-loop control vs. feedback control, 
                  router-based vs. source-based, backpressure, 
                  reservation vs. walk-in, as well as a single scheme 
                  or multiple schemes.}, 
  url = 
                  {\url{http://www.cis.ohio-state.edu/~jain/papers/cong_myt.htm}} 
} 
@Book{Jai91, 
  author =	 {R. Jain}, 
  title =	 {The Art of Computer Systems Performance Analysis: 
                  Techniques for Experimental Design, Measurement, 
                  Simulation, and Modeling}, 
  publisher =	 {John Wiley and Sons}, 
  year =	 1991, 
  address =	 {New York, NY} 
} 
@Article{Jai92, 
  author =	 {R. jain}, 
  title =	 {Myths about Congestion Management in High Speed 
                  Networks}, 
  journal =	 {Internetworking: Research and Experience}, 
  year =	 1992, 
  volume =	 3, 
  pages =	 {101--103}, 
  annote =	 {Same as \ref{Jai90}.}, 
  url = 
                  {\url{http://www.cis.ohio-state.edu/~jain/papers/cong_myt.htm}} 
} 
@Article{Jai95, 
  author =	 {R. Jain}, 
  title =	 {Congestion Control and Traffic Management in {ATM} 
                  Networks: Recent Advances and A Survey}, 
  journal =	 {Computer Networks and {ISDN} Systems}, 
  year =	 1996, 
  volume =	 28, 
  number =	 13, 
  month =	 Feb, 
  annote =	 {Describe the congestion control mechanisms for ATM 
                  networks. Present criteria for the selection between 
                  rate-based and credit-based approach.}, 
  url =		 {} 
} 
@InProceedings{Jay80, 
  author =	 {N. Jayant}, 
  title =	 {Effects of Packet Loss on Waveform Coded Speech}, 
  booktitle =	 {Fifth International Conference on Computer 
                  Communications}, 
  pages =	 {275--280}, 
  year =	 1980, 
  address =	 {Atlanta, GA}, 
  month =	 oct 
} 
@InProceedings{Ji04, 
  author =	 {Xiang Ji}, 
  title =	 {Sensor Positioning in Wireless Ad-hoc Sensor 
                  Networks with Multidimensional Scaling}, 
  crossref =	 "infocom04" 
} 
@Article{K9608, 
  author =	 {Gunnar Karlsson}, 
  title =	 {Asynchronous transfer of video}, 
  journal =	 {IEEE Communications Magazine}, 
  year =	 1996, 
  volume =	 34, 
  number =	 8, 
  month =	 aug 
} 
@manual{KA98, 
  author =	 {Stephen, Kent and Atkinson, Randall}, 
  title =	 {{IP} Authentication Header, INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 Jul 
} 
@InProceedings{KB96, 
  author =	 {Randy H. Katz and Eric A. Brew}, 
  title =	 {The Case for Wireless Overlay Networks}, 
  booktitle =	 {{SPIE} Multimedia and Networking Conference 
                  ({MMNC}'96)}, 
  year =	 1996, 
  address =	 {San Jose, CA}, 
  month =	 {January }, 
  url =		 {} 
} 
@Misc{KB97, 
  author =	 {Jacek B. Krawczyk and Steffan Berridge }, 
  title =	 {Relaxation Algorithms in Finding Nash Equilibria}, 
  howpublished = {In Computational Economics from Economics Working 
                  Paper Archive at WUSTL }, 
  month =	 Jul, 
  year =	 1997, 
  url = 
                  {\url{http://econwpa.wustl.edu/eprints/comp/papers/9707/9707002.abs}} 
} 
@InProceedings{KBC94, 
  author =	 {H. T. Kung and T. Blackwell and A. Chapman}, 
  title =	 {Credit-Based Flow Control for {ATM} Networks: Credit 
                  Update Protocol, Adaptive Credit Allocation, and 
                  Statistical Multiplexing}, 
  crossref =	 "sigcomm94", 
  year =	 1994, 
  url =		 {One of the proposals for ATM congestion control.}, 
  url =		 {\url{http://www.eecs.harvard.edu/~htk/paper/sigcm994.pdf}} 
} 
@InProceedings{KH03, 
  author =	 {Jiejun Kong and Xiaoyan Hong}, 
  title =	 {{ANODR}: {AN}onymous {O}n {D}emand {R}outing Protocol with 
                  Untraceable Routes for Mobile Ad-hoc Networks}, 
  crossref =	 {mobihoc03}, 
  pages =	 {291--302}, 
  year =	 2003, 
  annote =	 {location} 
} 
@Article{KHTK00, 
  author =	 {Sneha K. Kasera and Gisli Hjalmtysson and Donald 
                  F. Towsley and James F. Kurose} , 
  title =	 {{S}calable reliable multicast using multiple 
                  multicast channels} , 
  journal =	 ton , 
  volume =	 {8} , 
  number =	 {3} , 
  year =	 2000 , 
  month =	 jun 
} 
@inproceedings{KHTK97, 
  author =	 {Sneha K. Kasera and Gisli Hjalmtysson and Don 
                  Towsley and Jim Kurose}, 
  title =	 {Scalable Reliable Multicast using Multiple Multicast 
                  Channels}, 
  booktitle =	 {Proceedings of ACM SIGMETRICS '97}, 
  year =	 1997 
} 
@InProceedings{KK00, 
  author =	 {Brad Karp and H. T. Kung}, 
  title =	 {{GPSR}: Greedy Perimeter Stateless Routing for 
                  Wireless Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {We present Greedy Perimeter Stateless Routing 
                  (GPSR), a novel routing protocol for wireless 
                  datagram networks that uses the positions of routers 
                  and a packet's destination to make packet forwarding 
                  decisions. GPSR makes greedy forwarding decisions 
                  using only information about a router's immediate 
                  neighbors in the network topology. When a packet 
                  reaches a region where greedy forwarding is 
                  impossible, the algorithm recovers by routing around 
                  the perimeter of the region. By keeping state only 
                  about the local topology, GPSR scales better in 
                  per-router state than shortest- path and ad-hoc 
                  routing protocols as the number of network 
                  destinations increases. Under mobility's frequent 
                  topology changes, GPSR can use local topology 
                  information to find correct new routes quickly. We 
                  describe the GPSR protocol, and use extensive 
                  simulation of mobile wireless networks to compare 
                  its performance with that of Dynamic Source 
                  Routing. Our simulations demonstrate GPSR's 
                  scalability on densely deployed mobile networks. }, 
  annote =	 {GPSR}, 
  url =		 {} 
} 
@InProceedings{KKK00, 
  author =	 {Young-Gook Kim and JongWon Kim and C.-C. Jay Kuo}, 
  title =	 {Network-aware error control using smooth and fast 
                  rate adaptation mechanism for {TCP}-friendly 
                  Internet video}, 
  crossref =	 "icccn00", 
  annote =	 {Uses different error resilience options according to 
                  loss rate and RTT.} 
} 
@InProceedings{KKP99, 
  author =	 {J. M. Kahn and R. H. Katz and K. S. J. Pister}, 
  title =	 {Mobile Networking for Smart Dust}, 
  crossref =	 {mobicom99}, 
  year =	 1999, 
  url = 
                  {\url{http://robotics.eecs.berkeley.edu/~pister/publications/1999/mobicom\_99.pdf}} 
} 
@InProceedings{KKT98, 
  author =	 {Sneha K. Kasera and Jim Kurose and Don Towsley}, 
  title =	 {A Comparison of Server-based and Receiver-based 
                  Local Recovery Approaches for Scalable Reliable 
                  Multicast}, 
  crossref =	 "infocom98", 
  abstract =	 {RM} 
} 
@InProceedings{KLLP+97, 
  author =	 {D. R. Karger and E. Lehman and F. T. Leighton and 
                  R. Panigrahy and M. S. Levine and D. Lewin}, 
  title =	 {Consistent Hashing and Random Trees: Distributed 
                  Caching Protocols for Relieving Hot Spots on the 
                  World Wide Web}, 
  booktitle =	 {Proceedings of {STOC}}, 
  url =		 {}, 
  year =	 1997 
} 
@Article{KLM96, 
  author =	 {L.P. Kaelbling and M.L. Littman and A.W. Moore}, 
  title =	 {Reinforcement Learning: A Survey}, 
  journal =	 {Journal of Artificial Intelligence Research}, 
  year =	 1996, 
  volume =	 4, 
  pages =	 {237--285}, 
  url = 
                  {\url{http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume4/kaelbling96a.pdf}} 
} 
@Article{KLO95, 
  author =	 {Y. A. Korilis and A. A. Lazar and A. Orda}, 
  title =	 {Architecting Noncooperative Networks}, 
  journal =	 jsac, 
  year =	 1995, 
  volume =	 13, 
  number =	 7, 
  pages =	 {1241--1251}, 
  month =	 Sep 
} 
@Article{KLO97, 
  author =	 {Yannis A. Korilis and Aurel A. Lazar and Ariel Orda}, 
  title =	 {Achieving Network Optima Using {S}tackelberg Routing 
                  Strategies}, 
  journal =	 ton, 
  year =	 1997, 
  volume =	 5, 
  number =	 1, 
  pages =	 {161--173}, 
  month =	 Feb, 
  abstract =	 {Single source destination. Parallel links. Necessary 
                  and sufficient conditions} 
} 
@InProceedings{KLSS+01, 
  author =	 {Vikram Kanodia and Chengzhi Li and Ashutosh 
                  Sabharwal and Bahareh Sadeghi and Edward 
                  W. Knightly}, 
  title =	 {Distributed Multi-Hop Scheduling and Medium Access 
                  with Delay and Throughput Constraints}, 
  crossref =	 "mobicom01", 
  abstract =	 {Providing quality of service in random access 
                  multi-hop wireless networks requires support from 
                  both medium access and packet scheduling 
                  algorithms. However, due to the distributed nature 
                  of ad hoc networks, nodes may not be able to 
                  determine the next packet that would be transmitted 
                  in a (hypothetical) centralized and ideal dynamic 
                  priority scheduler. In this paper, we develop two 
                  mechanisms for QoS communication in multi-hop 
                  wireless networks. First, we devise distributed 
                  priority scheduling, a technique that piggybacks the 
                  priority tag of a node's head-of-line packet onto 
                  handshake and data packets; e.g., RTS/DATA packets 
                  in IEEE 802.11. By monitoring transmitted packets, 
                  each node maintains a scheduling table which is used 
                  to assess the node's priority level relative to 
                  other nodes. We then incorporate this scheduling 
                  table into existing IEEE 802.11 priority back-off 
                  schemes to approximate the idealized 
                  schedule. Second, we observe that congestion, link 
                  errors, and the random nature of medium access 
                  prohibit an exact realization of the ideal 
                  schedule. Consequently, we devise a scheduling 
                  scheme termed multi-hop coordination so that 
                  downstream nodes can increase a packet's relative 
                  priority to make up for excessive delays incurred 
                  upstream. We next develop a simple analytical model 
                  to quantitatively explore these two mechanisms. In 
                  the former case, we study the impact of the 
                  probability of overhearing another packet's priority 
                  index on the scheme's ability to achieve the ideal 
                  schedule. In the latter case, we explore the role of 
                  multi-hop coordination in increasing the probability 
                  that a packet satisfies its end-to-end QoS 
                  target. Finally, we perform a set of ns-2 
                  simulations to study the scheme's performance under 
                  more realistic conditions.} 
} 
@InProceedings{KLXG+02, 
  author =	 {Jiejun Kong and Haiyun Luo and Kaixin Xu and Daniel 
                  Lihui Gu and Mario Gerla and Songwu Lu}, 
  title =	 {Adaptive Security for Multi-layer Ad-hoc Networks}, 
  booktitle =	 {{WCMC '02}}, 
  year =	 2002, 
  url = 
                  {\url{http://www.cs.ucla.edu/NRL/wireless/PAPER/wcmc02-onr.ps.gz}} 
} 
@TechReport{KM01, 
  author =	 {V.S. Anil Kumar and Madhav V. Marathe}, 
  title =	 {Improved Results for {S}tackelberg Scheduling 
                  Strategies}, 
  institution =	 {Los Alamos National Laboratory}, 
  year =	 2001, 
  month =	 Nov, 
  url = 
                  {\url{http://www.lanl.gov/orgs/d/d2/documents/pdf/2001/LA-UR-01-6406.pdf}} 
} 
@Article{KM87, 
  author =	 {C. Kent and J. Mogul}, 
  title =	 {Fragmentation Considered Harmful}, 
  journal =	 ccr, 
  year =	 {1987}, 
  volume =	 {17}, 
  number =	 {5}, 
  pages =	 {110--120}, 
  month =	 aug, 
  abstract =	 {} 
} 
@Misc{KM97, 
  author =	 {A. Kamerman and L. Monteban}, 
  title =	 {Wave{LAN}-{II}: A high-performance wireless {LAN} 
                  for the unlicensed band}, 
  howpublished = {Bell Labs Technical Journal, pp. 118--133}, 
  month =	 {Summer}, 
  year =	 1997, 
  annote =	 {Mutlti-rate radios are capable of transmitting at 
                  multiple rates, using different modulation 
                  schemes. WaveLAN uses a sender-based mechanism for 
                  determining the suitable rate: 1) Rate is decreased 
                  if cannot be transmitted at a high rate; 2) 
                  increased otherwise.}, 
  url =		 {} 
} 
@TechReport{KMBL99, 
  author =	 {Peter Key and Derek McAuley and Paul Barham and 
                  Koenraad Laevens}, 
  title =	 {Congestion Pricing for Congestion Avoidance}, 
  institution =	 {Microsoft Research}, 
  year =	 1999, 
  number =	 {MSR--TR--99--15}, 
  month =	 Feb, 
  abstract =	 {This paper describes the use of Congestion Pricing 
                  as a means of providing Congestion Control and 
                  Differentiated Quality of Service. The application 
                  of the proposed technique to the Internet Protocol 
                  has the advantage that it can be simply implemented 
                  using Explicit Congestion Notification. In 
                  particular: the network mechanism is independent of 
                  higher level protocols; the end systems can continue 
                  to exhibit current TCP behaviours; new multiprotocol 
                  flexibility is made available to end systems and 
                  users. Architectural issues are discussed, including 
                  important aspects of aggregation and charging. We 
                  describe our methodology for assessing the scheme 
                  via a distributed network simulator. Initial results 
                  are presented which compare and contrast various 
                  adaptive strategies that achieve a variable range of 
                  TCP-like behaviours."}, 
  url = 
                  {\url{http://research.microsoft.com/scripts/pubdb/pubsasp.asp?RecordID=263}} 
} 
@InProceedings{KMR02, 
  title =	 {{SOS}: Secure Overlay Services}, 
  author =	 {A. Keromytis and V. Misra and D. Rubenstein}, 
  crossref =	 {sigcomm02}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm2002/papers/sos.html}} 
} 
@Unpublished{KMT97, 
  author =	 {Frank Kelly and Aman Maulloo and David Tan}, 
  title =	 {Rate Control for Communication Networks: Shadow 
                  prices, proportional fairness and stability}, 
  note =	 {\url{http://www.statslab.cam.ac.uk/frank/rate.html}}, 
  year =	 1997 
} 
@Article{KMT98, 
  author =	 {F. P. Kelly and A.K. Maulloo and D.K.H. Tan}, 
  title =	 {Rate control in communication networks: shadow 
                  prices, proportional fairness and stability}, 
  journal =	 {Journal of the Operational Research Society }, 
  year =	 1998, 
  volume =	 49, 
  pages =	 {237--252}, 
  url =		 {\url{http://www.statslab.cam.ac.uk/~frank/rate.html}} 
} 
@InProceedings{KN01, 
  author =	 {Minkyong Kim and Brian Noble}, 
  title =	 {Mobile Network Estimation}, 
  crossref =	 "mobicom01", 
  abstract =	 {Mobile systems must adapt their behavior to changing 
                  network conditions. To do this, they must accurately 
                  estimate available network capacity. Producing 
                  quality estimates is challenging because network 
                  observations are noisy, particularly in mobile, ad 
                  hoc networks. Current systems depend on simple, 
                  exponentially weighted moving average (EWMA) 
                  filters. These filters are either able to detect 
                  true changes quickly or to mask observed noise and 
                  transients, but cannot do both. In this paper, we 
                  present four filters designed to react quickly to 
                  persistent changes while tolerating transient 
                  noise. Such filters are agile when possible, but 
                  stable when necessary, adapting their behavior to 
                  prevailing conditions. These filters are evaluated 
                  in a variety of networking situations, including 
                  persistent and transient change, congestion, and 
                  topology changes. We find that one filter, based on 
                  techniques from statistical process control, 
                  provides performance superior to the other 
                  three. Compared to two EWMA filters, one agile and 
                  the other stable, it is able to offer the agility of 
                  the former in four of five scenarios and the 
                  stability of the latter in three of four scenarios.}, 
  url =		 {} 
} 
@InProceedings{KN02, 
  author =	 {Jorma Kilpi and Ilkka Norros}, 
  title =	 {Testing the {G}aussian Approximation of Aggregate 
                  Traffic}, 
  crossref =	 {imc02}, 
  year =	 2002, 
  url = 
                  {\url{http://www.icir.org/vern/imw-2002/imw2002-papers/122.pdf}}, 
  abstract =	 {We search for methods or tools to detect whether the 
                  1-dimensional marginal distribution of traffic 
                  increments of aggregate TCP-traffic satisfy the 
                  hypothesis of approximate normality. Gaussian 
                  approximation requires a high level of aggregation 
                  in both vertical (source aggregation) and 
                  horizontal (time scale) directions. We discuss 
                  these different concepts of aggregation first 
                  separately, with an example from real data traffic, 
                  and show how to rule out cases where the level of 
                  aggregation will not be sufficient. Gaussian 
                  approximation is then quantified with the square of 
                  the linear correlation coefficient in 
                  normal-quantile plots. We propose an elementary 
                  method based on this correlation test, by looking at 
                  the behavior of the test statistic for different 
                  sample sizes, and show positive and negative 
                  examples from the example data. We use this method 
                  to look for the first time scale, where the Gaussian 
                  approximation is plausible with the example data, 
                  and then we look how much more vertical 
                  aggregationwould be needed for smaller time scales 
                  in order to obtain a reasonable approximation by 
                  normal distribution.} 
} 
@InProceedings{KP01, 
  author =	 {E. Koutsoupias and C. Papadimitriou}, 
  title =	 {Worst-Case Equilibria}, 
  booktitle =	 {Proceedings of the 16th Annual Symposium on 
                  Theoretical Aspects of Computer Science}, 
  pages =	 {404--413}, 
  year =	 1999, 
  url =		 {\url{http://www.cs.berkeley.edu/\verb$~$christos/nash.ps}} 
} 
@InProceedings{KR01, 
  author =	 {Uwe Kubach and Kurt Rothermel}, 
  title =	 {Exploiting Location Information for 
                  Infostation-Based Hoarding}, 
  crossref =	 "mobicom01", 
  abstract =	 {With the increasing popularity of mobile computing 
                  devices, the need to access information in mobile 
                  environments has grown rapidly. Since the 
                  information has to be accessed over wireless 
                  networks, mobile information systems often have to 
                  deal with problems like low bandwidth, high delay, 
                  and frequent disconnections. Information hoarding is 
                  a method that tries to overcome these problems by 
                  transferring information, which the user will 
                  probably need, in advance. The hoarding mechanism 
                  that we describe in this paper exploits the location 
                  dependence of the information access, which is often 
                  found in mobile information systems. Our simulation 
                  results show that it is beneficial to do so and that 
                  we achieve higher hit ratios than with a caching 
                  mechanism.} 
} 
@Article{KRT00, 
  author =	 "Jon Kleinberg and Yuval Rabani and {\'E}va Tardos", 
  title =	 {Allocating Bandwidth for Bursty Connections}, 
  journal =	 {{SIAM} Journal on Computing}, 
  year =	 2000, 
  volume =	 30, 
  number =	 1, 
  pages =	 {191--217}, 
  url = 
                  {\url{http://epubs.siam.org/sam-bin/getfile/SICOMP/articles/32914.pdf}} 
} 
@inproceedings{KRT97, 
  author =	 "Jon Kleinberg and Yuval Rabani and {\'E}va Tardos", 
  title =	 "Allocating bandwidth for bursty connections", 
  pages =	 "664--673", 
  year =	 1997, 
  crossref =	 {stoc97}, 
  url = 
                  {} 
} 
@InProceedings{KS00, 
  author =	 {S. Kunniyur and R. Srikant}, 
  title =	 {End-to-end congestion control: utility functions, 
                  random losses and {ECN} marks}, 
  crossref =	 {infocom00}, 
  year =	 2000, 
  url =		 {\url{http://comm.csl.uiuc.edu/~srikant/pub.html}} 
} 
@InProceedings{KS78, 
  author =	 {L. Kleinrock and J. Sylvester}, 
  title =	 {Optimum transmission radii for packet radio networks 
                  or why six is a magic number}, 
  booktitle =	 {{IEEE} National Telecommunications Conference}, 
  pages =	 {4.3.1--4.3.5}, 
  year =	 1978, 
  address =	 {Birmingham, AL}, 
  month =	 Dec, 
  url =		 {} 
} 
@InProceedings{KSLB99, 
  author =	 {T. Kim and R. Sivakumar and K.-W. Lee and 
                  V. Bharghavan}, 
  title =	 {Multicast Service Differentiation in Core-Stateless 
                  Networks}, 
  booktitle =	 {International Workshop on Networked Group 
                  Communication}, 
  year =	 1999, 
  address =	 {Pisa, Italy}, 
  month =	 nov, 
  abstract =	 {} 
} 
@TechReport{KST00, 
  author =	 {Koushik Kar and Saswati Sarkar and Leandros 
                  Tassiulas}, 
  title =	 {A primal algorithm for optimization based rate 
                  control for unicast seessions}, 
  institution =	 {Department of Electrical & Computer Engg. University 
                  of Maryland}, 
  address =	 {College Park, MD , U.S.A.}, 
  year =	 2000, 
  month =	 Jul, 
  url = 
                  {\url{http://www.isr.umd.edu/TechReports/CSHCN/2000/CSHCN_TR_2000-7}} 
} 
@TechReport{KSYL00:iptel, 
  author =	 {Min Sik Kim and Nishanth R. Sastry and Yang Richard 
                  Yang and Simon S. Lam}, 
  title =	 {Is {TCP}-Friendly Viable?}, 
  institution =	 utcs, 
  year =	 2000, 
  number =	 {TR--00--27}, 
  month =	 nov 
} 
@Unpublished{KT02, 
  author =	 {V. R. Konda and J. N. Tsitsiklis}, 
  title =	 {Convergence Rate of Two-Time Scale Stochastic 
                  Approximation}, 
  note =	 {Submitted}, 
  month =	 Mar, 
  year =	 2002, 
  url =		 {\url{http://web.mit.edu/jnt/www/Papers/P-02-kon-rate.pdf}} 
} 
@Article{KT75:csma, 
  author =	 {L. Kleinrock and F.A. Tobagi}, 
  title =	 {Packset switching in radio channels: Part {I} - 
                  Carrier Sense Multiple Access Modes and Their 
                  Throughput-Delay Characteristics}, 
  journal =	 {IEEE Transactions on Communications}, 
  year =	 1975, 
  volume =	 23, 
  number =	 12, 
  pages =	 {1400--1416}, 
  annote =	 {CSMA} 
} 
@Book{KT75:stochastic, 
  author =	 {Samuel Karlin and Howard M. Taylor}, 
  title =	 {A First Course in Stochastic Processes}, 
  publisher =	 {Academic Press}, 
  year =	 1975, 
  edition =	 {Second Edition} 
} 
@Article{KU00, 
  author =	 {Jacek B. Krawczyk and Stanislav Uryasev}, 
  title =	 {Relaxation Algorithms to find Nash Equilibria with 
                  Economic Applications}, 
  journal =	 {Environmental Modeling and Assessment}, 
  year =	 2000, 
  volume =	 5, 
  pages =	 {63--73}, 
  url = 
                  {\url{http://www.ise.ufl.edu/uryasev/relaxation_algorithms_for_Nash_equilibrium.pdf}} 
} 
@InProceedings{KV98, 
  author =	 {Y.-B. Ko and N. H. Vaidya}, 
  title =	 {Location-aided routing ({LAR}) in mobile ad hoc 
                  networks}, 
  crossref =	 {mobicom98}, 
  year =	 1998, 
  abstract =	 {Assume the location of the destination is 
                  known. Then limit the flooding of the RREQ to 
                  expected area.}, 
  annote =	 {LAR; first geocast work, i.e., flood to all nodes in 
                  a region}, 
  url =		 {} 
} 
@InProceedings{KW00, 
  author =	 {Dina Katabi and John Wroclawski } , 
  title =	 {A framework for scalable global {I}{P}-anycast 
                  ({G}{I}{A})} , 
  crossref =	 {sigcomm00}, 
  url =		 {} 
} 
@InProceedings{KWB01, 
  author =	 {Bhaskar Krishnamachari and Stephen B. Wicker and 
                  Ramon Bejar}, 
  title =	 {Phase Transition Phenomena in Wireless Ad-Hoc 
                  Networks}, 
  booktitle =	 {Proceedings of Symposium on Ad-Hoc Wireless 
                  Networks, GlobeCom 2001}, 
  year =	 2001, 
  address =	 {Antonio, Texas}, 
  url = 
                  {\url{http://www.krishnamachari.net/papers/phaseTransitionWirelessNetworks.pdf}} 
} 
@Unpublished{KYL01, 
  author =	 {Min S. Kim and Yang Richard Yang and Simon S. Lam}, 
  title =	 {Design and Performance Improvement for 
                  Congestion-Controlled Multimedia Applications}, 
  note =	 {submit for publication.}, 
  month =	 Jul, 
  year =	 2001, 
  url =		 {} 
} 
@InProceedings{KZJL01, 
  author =	 {A. Konrad and B.Y. Zhao and A.D. Joseph and 
                  R. Ludwig}, 
  title =	 {Explicit Loss Notification and Wireless Web 
                  Perfromance}, 
  booktitle =	 {Proceedings of ACM MSWIM}, 
  year =	 2001, 
  abstract =	 {GSM; loss as a Markov model} 
} 
@InProceedings{KZLL+01, 
  author =	 {Jiejun Kong and Petros Zerfos and Haiyun Luo and 
                  Songwu Lu and Lixia Zhang}, 
  title =	 {Providing Robust and Ubiquitous Security Support for 
                  Mobile Ad-Hoc Networks}, 
  crossref =	 {icnp01}, 
  year =	 2001, 
  url = 
                  {\url{http://www.cs.ucla.edu/~jkong/publications/ICNP01-jkong.pdf}} 
} 
@InProceedings{Kar90, 
  author =	 {P. Karn}, 
  title =	 {{MACA} - A new channel access method for packet 
                  radio}, 
  booktitle =	 {{ARRL}/{CRRL} Amateur Radio 9th Computer Networking 
                  Conference}, 
  year =	 1990, 
  month =	 Sep, 
  abstract =	 {Propose RTS/CTS}, 
  url =		 {} 
} 
@article{Kat94, 
  author =	 "R. H. Katz", 
  title =	 "Adaptation and Mobility in Wireless Information 
                  Systems", 
  journal =	 "IEEE Personal Communications", 
  volume =	 1, 
  pages =	 "6--17", 
  year =	 1994, 
  abstract =	 {A confusing array of new wireless untethered 
                  communications services, for voice and data, in 
                  real-time or delayed, interactive or one-way, 
                  in-building or out-of-doors, are rapidly becoming 
                  available. In this paper, we argue that despite the 
                  widely varying issues of engineering that span the 
                  creation of these diverse wireless services, the 
                  unique underlying aspect is that they must be able 
                  to adapt to a constantly changing environment 
                  brought on by mobility. Mobile systems must be able 
                  to...}, 
  url =		 {} 
} 
@InProceedings{Kay99, 
  author =	 {Peter Kay}, 
  title =	 {Service differentiation: congestion pricing, brokers 
                  and bandwidth futures}, 
  booktitle =	 {NOSSDAV '99}, 
  year =	 1999, 
  month =	 Jul, 
  url = 
                  {\url{http://research.microsoft.com/research/network/disgame.asp}} 
} 
@Article{Kel00, 
  author =	 {Frank Kelly}, 
  title =	 {Models for a self-managed Internet }, 
  journal =	 {Philosophical Transactions of the Royal Society}, 
  year =	 2000, 
  url =		 {\url{http://www.statslab.cam.ac.uk/~frank/smi.html}}, 
  volume =	 {A358} 
} 
@InCollection{Kel01, 
  author =	 {Frank Kelly}, 
  booktitle =	 {Mathematics Unlimited - 2001 and Beyond}, 
  title =	 {Mathematical modelling of the {I}nternet}, 
  editor =	 {B. Engquist and W. Schmid}, 
  publisher =	 {Springer-Verlag}, 
  year =	 2001, 
  url =		 {\url{http://www.statslab.cam.ac.uk/~frank/mmi.html}}, 
  pages =	 {685--702} 
} 
@Article{Kel97, 
  author =	 {Frank Kelly}, 
  title =	 {Charging and rate control for elastic traffic}, 
  journal =	 {European Transactions on Telecommunications}, 
  year =	 1997, 
  volume =	 8, 
  pages =	 {33--37}, 
  url =		 {\url{http://www.statslab.cam.ac.uk/~frank/elastic.html}} 
} 
@InProceedings{Ken77, 
  author =	 {S. Kent}, 
  title =	 {Encryption-Based Protection for Interactive 
                  User/Computer Communication}, 
  booktitle =	 {The Fifth Data Communications Symposium}, 
  month =	 sep, 
  year =	 {1977} 
} 
@InProceedings{Ker98, 
  author =	 {Roger Kermode}, 
  title =	 {Scoped Hybrid Automatic Repeat reQuest with Forward 
                  Error Correction ({SHARQFEC})}, 
  crossref =	 "sigcomm98", 
  abstract =	 {Provides scoped hybrid. Its simulation scenario: 7 
                  central nodes, each node has 3 children, and each 
                  child further has 3 children. The loss rate between 
                  two central nodes is about 3-8\%. The loss rate from 
                  the central node to its child is 8\%, and the loss 
                  rate between each child and its child is 4\%. In the 
                  simulation, the source send 1024 1000-byte packet at 
                  a rate of 800Kbps (100 packet per second). The 
                  comparison is to compare NACK traffic, Data/Repair 
                  traffic along time (0.1sec) for approach protocol 
                  schemes} 
} 
@InProceedings{Kes91, 
  author =	 {S. Keshav}, 
  title =	 {A control theoretic approach to flow control}, 
  crossref =	 "sigcomm91", 
  url = 
                  {\url{http://www.acm.org/sigcomm/ccr/archive/1995/jan95/ccr-9501-keshav91.html}} 
} 
@Book{Kes97, 
  author =	 {S. Keshav}, 
  title =	 {An Engineering Approach to Computer Networking}, 
  publisher =	 {Addison-Wesley}, 
  year =	 1997 
} 
@Misc{Keynote, 
  key =		 {Keynote Inc.}, 
  author =	 {{Keynote Inc.}}, 
  howpublished = {\url{http://www.keynote.com/}} 
} 
@Book{Kre90, 
  author =	 {David M. Kreps}, 
  title =	 {A Course in Microeconomic Theory}, 
  publisher =	 {Princeton University Press}, 
  year =	 1990 
} 
@Book{Kre91, 
  author =	 {David M. Kreps}, 
  title =	 {Game Theory and Economic Modelling}, 
  publisher =	 {Oxford Press}, 
  year =	 1991 
} 
@techreport{Kum98, 
  author =	 "Shailesh Kumar", 
  title =	 "Confidence based Dual Reinforcement {Q}-Routing: an 
                  On-line Adaptive NetworkRouting Algorithm", 
  number =	 "AI98-267", 
  month =	 "1,", 
  year =	 1998, 
  annote =	 {adaptive routing}, 
  url =		 {} 
} 
@Article{Kuo95, 
  author =	 {F. F. Kuo}, 
  title =	 {The {A}loha System}, 
  journal =	 ccr, 
  year =	 1995, 
  url = 
                  {\url{http://www.acm.org/sigcomm/ccr/archive/1995/jan95/ccr-9501-kuo.pdf}} 
} 
@InProceedings{LA00, 
  author =	 {Richard J. La and Venkat Anantharam}, 
  title =	 {Charge-Sensitive {TCP} and Rate Control in the 
                  {I}nternet}, 
  crossref =	 {infocom00}, 
  year =	 2000, 
  url =		 {} 
} 
@TechReport{LA01, 
  author =	 {Richard La and Venkat Anantharam}, 
  title =	 {Optimal routing control: Repeated Game Approach}, 
  institution =	 {University of California, Berkeley}, 
  year =	 2001, 
  annote =	 {} 
} 
@Article{LA02, 
  author =	 {Richard J. La, Venkat Anantharam}, 
  title =	 {Utility Based Rate Control in the Internet for 
                  Elastic Traffic. }, 
  journal =	 {IEEE/ACM Transactions on Networking}, 
  volume =	 10, 
  number =	 2, 
  page =	 {272-286}, 
  month =	 Apr, 
  year =	 2002, 
  url =		 {\url{http://www.eecs.berkeley.edu/~ananth/}} 
} 
@Article{LA02GAME, 
  author =	 {Richard J. La, Venkat Anantharam}, 
  title =	 {Optimal Routing Control: Repeated Game Approach }, 
  journal =	 {IEEE Transactions on Automatic Control}, 
  year =	 2002, 
  url =		 {\url{http://www.eecs.berkeley.edu/~ananth/}} 
} 
@InProceedings{LABJ00, 
  author =	 {C. Labovitz and A. Ahuja and A. Bose and 
                  F. Jahanian}, 
  title =	 {Delayed {I}nternet Routing Convergence}, 
  crossref =	 {sigcomm00}, 
  year =	 2000, 
  abstract =	 {This paper examines the latency in Internet path 
                  failure, failover and repair due to the convergence 
                  properties of inter-domain routing. Unlike switches 
                  in the public telephony network which exhibit 
                  failover on the order of milliseconds, our 
                  experimental measurements show that inter-domain 
                  routers in the packet switched Internet may take 
                  tens of minutes to reach a consistent view of the 
                  network topology after a fault. These delays stem 
                  from temporary routing table oscillations formed 
                  during the operation of the BGP path selection 
                  process on Internet backbone routers. During these 
                  periods of delayed convergence, we show that 
                  end-to-end Internet paths will experience 
                  intermittent loss of connectivity, as well as 
                  increased packet loss and latency. We present a 
                  two-year study of Internet routing convergence 
                  through the experimental instrumentation of key 
                  portions of the Internet infrastructure, including 
                  both passive data collection and fault-injection 
                  machines at major Internet exchange points. Based on 
                  data from the injection and measurement of several 
                  hundred thousand inter-domain routing faults, we 
                  describe several unexpected properties of 
                  convergence and show that the measured upper bound 
                  on Internet inter-domain routing convergence delay 
                  is an order of magnitude slower than previously 
                  thought. Our analysis also shows that the upper 
                  theoretic computational bound on the number of 
                  router states and control messages exchanged during 
                  the process of BGP convergence is factorial with 
                  respect to the number of autonomous systems in the 
                  Internet. Finally, we demonstrate that much of the 
                  observed convergence delay stems from specific 
                  router vendor implementation decisions and ambiguity 
                  in the BGP specification. }, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm2000/conf/paper/sigcomm2000-5-2.ps.gz}} 
} 
@Article{LAP99, 
  author =	 {X. Li and M. H. Ammar and S. Paul}, 
  title =	 {Video Multicast over the {I}nternet}, 
  journal =	 {IEEE Network Magazine}, 
  year =	 1999, 
  volume =	 13, 
  number =	 2, 
  pages =	 {46--60}, 
  month =	 mar 
} 
@InProceedings{LAR01, 
  author =	 {Qun Li and Javed Aslam and Daniela Rus}, 
  title =	 {Online Power-aware Routing in Wireless Ad-hoc 
                  Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {This paper discusses online power-aware routing in 
                  large wireless ad-hoc networks. We seek to optimize 
                  the lifetime of the network. We show that online 
                  power-aware routing does not have a constant 
                  competitive ratio to the off-line optimal 
                  algorithm. We develop an approximation algorithm 
                  called $max$-$min$ has a good empirical competitive 
                  ratio. To ensure scalability, we introduce a second 
                  online algorithm for power-aware routing. This 
                  hierarchical algorithm is called zone-based 
                  routing. Our experiments show that its performance 
                  is close to optimal. This paper would like to be 
                  considered for best student paper award.} 
} 
@InProceedings{LAS03, 
  author =	 {J. Lin and A.S. Morse and B.D.O. Anderson}, 
  title =	 {Multi-Agent Rendezvous Problem}, 
  booktitle =	 {Proceedings of 42nd {IEEE} Conference on Decision 
                  and Control}, 
  year =	 2003, 
  month =	 {Dec} 
} 
@inproceedings{LB00, 
  author =	 "Kevin Lai and Mary Baker", 
  title =	 "Measuring Link Bandwidths Using a Deterministic 
                  Model of Packet Delay", 
  crossref =	 "sigcomm00", 
  pages =	 "283--294", 
  year =	 2000, 
  url =		 {} 
} 
@InProceedings{LB93, 
  author =	 {Michael L. Littman and Justin A. Boyan}, 
  title =	 {A distributed reinforcement learning scheme for 
                  network routing}, 
  booktitle =	 {Proceedings of the 1993 International Workshop on 
                  Applications of Neural Networks to 
                  Telecommunications}, 
  pages =	 {45--51}, 
  year =	 1993, 
  address =	 {Hillsdale NJ}, 
  annote =	 {propose Q-routing; daptive routing}, 
  url = 
                  {\url{http://www.cs.duke.edu/~mlittman/docs/routing-iwannt.ps}} 
} 
@TechReport{LB93:tech, 
  author =	 {Michael Littman and Justin Boyan}, 
  title =	 {A distributed reinforcement learning scheme for 
                  network routing}, 
  institution =	 {School of Computer Science, Carnegie Mellon 
                  University}, 
  year =	 1993, 
  key =		 {CMU-CS-93-16}, 
  number =	 {CMU-CS-93-16}, 
  address =	 {Pittsburgh, PA}, 
  month =	 Jul, 
  annote =	 {adaptive routing}, 
  url = 
                  {\url{http://www.cs.duke.edu/~mlittman/docs/routing-cmu-tr.ps}} 
} 
@Misc{LB99, 
  title =	 {Beyond {TCP}-Friendliness: A New Paradigm for 
                  End-to-End Congestion Control}, 
  author =	 {A. Legout and E. W. Biersack}, 
  year =	 1999, 
  month =	 Sep, 
  abstract =	 {}, 
  url =		 {} 
} 
@InProceedings{LBCLM01, 
  author =	 {Jinyang Li and Charles Blake and Douglas S. J. De 
                  Couto and Hu Imm Lee and Robert Morris}, 
  title =	 {Capacity of Ad Hoc Wireless Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {Early simulation experience with wireless ad hoc 
                  networks suggests that their capacity can be 
                  surprisingly low, due to the requirement that nodes 
                  forward each others' packets. The actual capacity is 
                  a function of the total number of nodes in the 
                  network, the traffic patterns, and the detailed 
                  local radio interactions. This paper examines these 
                  factors alone and in combination, using simulation 
                  and analysis from first principles. The results 
                  include both general scaling relationships and 
                  specific constants helpful in understanding ad hoc 
                  simulations and in guiding deployment of ad hoc 
                  systems. The most significant result of this work is 
                  that the traffic pattern is the deciding factor in 
                  whether an ad hoc network's per node capacity will 
                  scale with the number of nodes in the net. If most 
                  communication is localized, the total network 
                  bandwidth available to each node stays roughly 
                  constant regardless of total network size. Non-local 
                  patterns, on the other hand, result in a decrease in 
                  per node bandwidth as the total number of nodes 
                  grows. Thus the question ``Are large ad hoc networks 
                  feasible?'' boils down to a question about the 
                  likely locality of communication in such networks.}, 
  url =		 {} 
} 
@InProceedings{LBRK+02, 
  author =	 {Andrew M. Ladd and Kostas E. Bekris and Algis Rudys 
                  and Lydia E. Kavraki and Dan S. Wallach and 
                  Guillaume Marceau}, 
  title =	 {Robotics-based Location Sensing Using Wireless 
                  {E}thernet}, 
  crossref =	 {mobicom02}, 
  year =	 2002, 
  url = 
                  {} 
} 
@Book{LC00, 
  author =	 {Yi-Bing Lin and Imrich Chlamtac}, 
  title =	 {Wireless and Mobile Network Architectures}, 
  publisher =	 {John Wiley and Sons}, 
  year =	 2000 
} 
@inproceedings{LCDB03, 
  author =	 {H. Lin and M. Chatterjee and S. K. Das and K. Basu}, 
  title =	 {{ARC}: An Integrated Admission and Rate Control 
                  Framework for {CDMA} Data Networks Based on 
                  Non-cooperative Games}, 
  crossref =	 {mobicom03}, 
  year =	 2003, 
  pages =	 {326--338} 
} 
@InProceedings{LCW02, 
  author =	 {Xiang-Yang Li and Gruia Calinescu and Peng-Jun Wan}, 
  title =	 {Distributed Construction of Planar Spanner and 
                  Routing for Ad Hoc Wireless Networks}, 
  crossref =	 {infocom02}, 
  year =	 2002, 
  url = 
                  {\url{http://www.csam.iit.edu/~xli/paper/Journal/LDel-TPDS.pdf}} 
} 
@InProceedings{LDR03, 
  author =	 {Qun Li and Michael De Rosa and Daniela Rus}, 
  title =	 {Distributed Algorithms for Guiding Navigation Across 
                  a Sensor network}, 
  crossref =	 {mobicom03} 
} 
@InProceedings{LG96, 
  author =	 {Levine, B. and Garcia-Luna-Aceves, J.J.}, 
  title =	 {A comparison of known classes of reliable multicast 
                  protocols}, 
  crossref =	 "icnp96", 
  abstract =	 {Reliable multicast} 
} 
@inproceedings{LG97, 
  author =	 {Brian Neil Levine and J.J. Garcia-Luna-Aceves}, 
  title =	 {Improving {I}nternet Multicast with Routing Labels}, 
  crossref =	 "icnp97", 
  abstract =	 {multicast routing with structures inside} 
} 
@InProceedings{LGT98, 
  author =	 {Li-wei Lehman and Stephen J. Garland and David 
                  L. Tennenhouse }, 
  title =	 {Active Reliable Multicast }, 
  crossref =	 {infocom98}, 
  url = 
                  {\url{http://www.sds.lcs.mit.edu/publications/infocom98_arm.html}} 
} 
@InProceedings{LJCKM00, 
  author =	 {Jinyang Li and John Jannotti and Douglas S. J. De 
                  Couto and David R. Karger and Robert Morris}, 
  title =	 {A Scalable Location Service for Geographic Ad Hoc 
                  Routing}, 
  crossref =	 "mobicom00", 
  abstract =	 {Geographic forwarding could form the foundation for 
                  large scale, ad hoc, mobile networks, but it is 
                  impractical without a similarly scalable means of 
                  determining destination locations. This paper 
                  presents a distributed location service (DLS) which 
                  fills this need while preserving the decentralized 
                  advantages of ad hoc networks. The DLS we present 
                  has the following desirable properties. It uses only 
                  the mobile nodes of the ad hoc network, with no 
                  fixed infrastructure. The resources (CPU time, 
                  messages exchanged, and storage) each node 
                  contributes to the location service are proportional 
                  to the log of the total number of nodes and are 
                  spread evenly amongst the nodes. Queries for the 
                  locations of nearby nodes are satisfied with 
                  correspondingly local communication. Finally, the 
                  failure of any single node affects the location 
                  database service for only a handful of other 
                  nodes. In our DLS, each node maintains a set of 
                  location servers which it keeps up to date with its 
                  current location. A node sends updates to its 
                  location servers without knowing their actual 
                  identities, assisted by a predefined ordering of 
                  node identifiers and a predefined spatial 
                  hierarchy. Similarly, location queries may be routed 
                  to a node's location servers without knowing their 
                  identities, using the same predefined network 
                  relationships. The only lower-level network service 
                  the DLS needs is geographic forwarding. This paper 
                  explains how the distributed location service works, 
                  analyzes its expected scaling and performance 
                  properties, and presents simulation results 
                  supporting that analysis. }, 
  annote =	 {Grid Location Service; GLS} 
} 
@InProceedings{LJDKM00, 
  author =	 {J. Li and J. Jannotti and D. S. J. De Couto and 
                  D. R. Karger and R. Morris}, 
  title =	 {A Scalable Location Service for Geographic Ad Hoc 
                  Routing}, 
  crossref =	 "mobicom00", 
  year =	 1999, 
  url =		 {\url{http://www.pdos.lcs.mit.edu/grid/grid.pdf}} 
} 
@InProceedings{LK01, 
  author =	 {Vincent Lau and Yu-Kwong Kwok}, 
  title =	 {Design and Analysis of a New Approach to 
                  MultipleBurst Admission Control for {CDMA}2000}, 
  crossref =	 "mobicom01", 
  abstract =	 {On the verge of realizing truly ubiquitous access to 
                  high quality data (e.g., media, financial, etc.), an 
                  efficient {\em burst admission control} algorithm is 
                  crucial in the 3rd generation wireless communication 
                  systems based on wideband CDMA standards. In this 
                  paper, we propose and analyze the performance of a 
                  novel burst admission technique, called the {\em 
                  multiple- burst admission--spatial dimension} 
                  algorithm (MBA-SD) to judiciously allocate the 
                  previous channels in wideband CDMA systems to burst 
                  requests. The major contributions of the present 
                  paper are the novel formulation of the problem as an 
                  integer programming problem and the derivation of an 
                  optimal algorithm for scheduling the burst 
                  requests. Both the forward link and the reverse link 
                  burst requests are considered and the system is 
                  simulated by dynamic simulations which takes into 
                  account of the user mobility, power control and soft 
                  handoff. We found that significant performance 
                  improvement, in terms of data user capacity, 
                  coverage, and admission and outage probabilities, 
                  could be achieved by our scheme compared to the 
                  existing burst assignment algorithms.} 
} 
@article{LK98, 
  author =	 {Lim, Man Yeob and Kim, Dae Young}, 
  title =	 {{IP} Extension for Reliable Multicasting}, 
  journal =	 {INTERNET-DFAFT}, 
  year =	 {1998}, 
  month =	 May, 
  abstract =	 {This propose only solve the problem when packets are 
                  dropped because of congestion at routers. I } 
} 
@InProceedings{LKB01, 
  author =	 {Kang-Won Lee and Tae-Eun Kim and Vaduvur Bharghavan}, 
  title =	 {A Comparison of End-to-End Congestion Control 
                  Algorithms: The Case of {AIMD} and {AIPD}}, 
  crossref =	 {infocom01}, 
  url =		 {} 
} 
@Article{LL99, 
  author =	 {S. H. Low and D. E. Lapsley}, 
  title =	 {Optimization Flow Control, {I}: Basic Algorithm and 
                  Convergence}, 
  journal =	 {IEEE/ACM Transactions on Networking}, 
  year =	 1999, 
  volume =	 7, 
  number =	 6, 
  pages =	 {861--875}, 
  month =	 Dec, 
  url =		 {\url{http://netlab.caltech.edu/pub/papers/ofc1_ToN.ps}} 
} 
@InProceedings{LLB00, 
  author =	 {Haiyun Luo and Songwu Lu and Vaduvur Bharghavan}, 
  title =	 {A New Model for Packet Scheduling in Multihop 
                  Wireless Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {Fair share of bandwidth and maximal resource 
                  utilization are two important design goals for every 
                  packet scheduling discipline. However, these two 
                  criteria are generally in conflict in a 
                  generic-topology multihop wireless network, where 
                  the wireless medium is shared among multiple spatial 
                  contending flows and spatial reuse of bandwidth is 
                  possible. In this paper, we propose a new model for 
                  packet scheduling that resolves this conflict. The 
                  major results of this paper are the following: (a) a 
                  new two-tier service model which guarantees a fair 
                  share of the basic channel service for each packet 
                  flow and in addition maximizes spatial reuse of 
                  bandwidth, (b) an ideal centralized packet 
                  scheduling algorithm that realizes the above service 
                  model, and (c) a novel multicast-tree-based 
                  distributed implementation which approximates the 
                  ideal centralized algorithm. We demonstrate the 
                  effectiveness of our proposed algorithms through 
                  both simulations and analysis. } 
} 
@InProceedings{LLG96, 
  author =	 {B. Levine and D. Lavo and J. J. Garcia-Luna-Aceve}, 
  title =	 {The Case for Concurrent Reliable Multicasting Using 
                  Shared Ack Trees,}, 
  booktitle =	 {ACM Multimedia 1996}, 
  year =	 {1996}, 
  month =	 nov, 
  address =	 {Boston, MA}, 
  abstract =	 {Affect RMTP-II to let multiple senders share one ack 
                  tree. They argue rm protocols should be based on a 
                  shared ack tree} 
} 
@TechReport{LLT02, 
  author =	 {Benyuan Liu and Zhen Liu and Don Towsley}, 
  title =	 {On the Capacity of Hybrid Wireless Networks}, 
  institution =	 {University of Massachusetts}, 
  year =	 2002, 
  month =	 Jul, 
  url =		 {} 
} 
@InProceedings{LM97, 
  author =	 {Dong Lin and Robert Morris}, 
  title =	 {Dynamics of Random Early Detection}, 
  crossref =	 {sigcomm97}, 
  year =	 1997, 
  url =		 {} 
} 
@Article{LM97b, 
  author =	 {T. V. Lakshman and U. Madhow}, 
  title =	 {The Performance of {TCP/IP} for networks with high 
                  bandwidth-delay products and random loss}, 
  journal =	 ton, 
  year =	 1997 
} 
@InProceedings{FMMK+04, 
  author =	 {Anja Feldmann and Olaf Maennel and Bruce Maggs and 
                  Nils Kammenhuber and Roberto De Prisco and Ravi 
                  Sundaram}, 
  title =	 {A methodology for estimating interdomain {W}eb 
                  traffic demand}, 
  crossref =	 {imc04} 
} 
@InProceedings{FMMB+04, 
  author =	 {Anja Feldmann and Olaf Maennel and Z. Morley Mao and 
                  Arthur Berger and Bruce Maggs}, 
  title =	 {Locating {I}nternet Routing Instabilities}, 
  crossref =	 {sigcomm04}, 
  year =	 2004 
} 
@InProceedings{LMJ97, 
  author =	 {C. Labovitz and G. R. Malan and F. Jahanian}, 
  title =	 {Internet Routing Instability}, 
  crossref =	 "sigcomm97", 
  year =	 1997, 
  url = 
                  {ftp://ftp.merit.edu/statistics/ipma/html/docs/lmjSigcomm97.ps.gz} 
} 
@Proceedings{LNCS2584, 
  editor =	 {Andr{\'e} Schiper and Alexander A. Shvartsman and 
                  Hakim Weatherspoon and Ben Y. Zhao}, 
  title =	 {Future Directions in Distributed Computing: Research 
                  and Position Papers}, 
  booktitle =	 {Future Directions in Distributed Computing: Research 
                  and Position Papers}, 
  publisher =	 {Springer}, 
  series =	 {Lecture Notes in Computer Science}, 
  volume =	 2584, 
  year =	 2003, 
  url = 
                  {\url{http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=2584}} 
} 
@InProceedings{GW02, 
  author =	 {Timothy G. Griffin and Gordon Wilfong}, 
  title =	 {On the Correctness of {IBGP} Configuration}, 
  crossref =	 {sigcomm02} 
} 
@InProceedings{LPA99, 
  author =	 {X. Li and S. Paul and M. H. Ammar}, 
  title =	 {Multi-Session Rate Control for Layered Video 
                  Multicast}, 
  booktitle =	 {Proceedings of Multimedia Computing and Networking 
                  '99}, 
  year =	 1999, 
  month =	 Jan 
} 
@InProceedings{LPKRB00, 
  author =	 {Kang-Won Lee and Rohit Puri and Tae{-}eun Kim and 
                  Kannan Ramchandran and Vaduvur Bharghavan}, 
  title =	 {An integrated source coding and congestion control 
                  framework for video streaming in the {I}nternet}, 
  crossref =	 "infocom00", 
  abstract =	 {Interaction between encoding and congestion control 
                  for video streaming}, 
  url =		 {} 
} 
@InProceedings{LPPA97, 
  author =	 {X. Li and S. Paul and P. Pancha and M. H. Ammar}, 
  title =	 {Layered Multicast with Retransmission ({LVMR}): 
                  Evaluation of Error Recovery Schemes}, 
  crossref =	 "nossdav97", 
  abstract =	 {higher possibiity for higher layer to drop} 
} 
@InProceedings{LPW01, 
  author =	 {Steven Low and Larry Peterson and Limin Wang}, 
  title =	 {Understanding {TCP} {V}egas: A Duality Model}, 
  crossref =	 "sigmetrics01", 
  year =	 2001, 
  abstract =	 {An analysis of TCP/Vegas using linear system dual 
                  model.}, 
  url =		 {http://www.cs.princeton.edu/nsg/papers/vegas.html} 
} 
@InProceedings{LR00, 
  author =	 {Qun Li and Daniela Rus }, 
  title =	 {Sending Messages to Mobile Users in Disconnected 
                  Ad-hoc Wireless Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {An ad-hoc network is formed by a group of mobile 
                  hosts upon a wireless network interface. Previous 
                  research in this area has concentrated on routing 
                  algorithms which are designed for fully connected 
                  networks. The usual way to deal with a disconnected 
                  ad-hoc network is to let the mobile computer wait 
                  the network reconnection passively, which may lead 
                  to unacceptable transmission delays. In this paper, 
                  we propose an approach that guarantees message 
                  transmission in minimal time. In this approach, 
                  mobile hosts actively modify their trajectories to 
                  transmit messages. We develop algorithms that 
                  minimize these modifications under two different 
                  assumptions: (a) the movements of all the nodes in 
                  the system and known and (b) the movements of the 
                  hosts in the system are not known.} 
} 
@InProceedings{LRSL+03, 
  author =	 {Haiyun Luo and Ramachandran Ramjee and Prasun Sinha 
                  and Li Li and Songwu Lu}, 
  title =	 {{UCAN}: A Unified Cellular and Ad-Hoc Network 
                  Architecture}, 
  crossref =	 {mobicom03} 
} 
@InProceedings{LS01, 
  author =	 {J. Lorch and A. J. Smith}, 
  title =	 {Improving dynamic voltage scaling algorithms with 
                  {PACE}}, 
  crossref =	 "sigmetrics01", 
  url = 
                  {\url{http://research.microsoft.com/~lorch/papers/pace.pdf}} 
} 
@InProceedings{LS98, 
  author =	 {M. Luby and J. Staddon}, 
  title =	 {Combinatorial Bounds for Broadcast Encryption}, 
  booktitle =	 eurocrypt98, 
  year =	 1998, 
  address =	 {Espoo, Finland} 
} 
@Article{LSM01, 
  author =	 {A. Lombaedo and G. Schembra and G. Morabito}, 
  title =	 {Traffic specifications for the transmission of 
                  stored {MPEG} video on the {I}nternet}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909590.pdf?isNumber=19626}} 
} 
@InProceedings{LSM98, 
  author =	 {Papadopoulos, G. and Parulkar, G. and Varghese, G.}, 
  title =	 {An Error Control Scheme for Large-Scale Multicast 
                  Applications}, 
  crossref =	 "infocom98", 
  abstract =	 {Router record downstream repairer, and has a change 
                  point}, 
  url = 
                  {\url{http://www.ccrc.wustl.edu/~christos/PostScriptDocs/Infocom98.ps.Z}} 
} 
@Article{LSP82, 
  author =	 {L. Lamport and R. Shostack and M. Pease}, 
  title =	 {The {B}yzantine generals problem}, 
  journal =	 {{ACM} Transactions on Proggramming Languages and 
                  Systems}, 
  year =	 1982, 
  volume =	 4, 
  number =	 3, 
  pages =	 {382--401} 
} 
@Article{LTS01, 
  author =	 {W.-H. Liao and Y.-C. Tseng and J.-P. Sheu}, 
  title =	 {{GRID}: a fully location-aware routing protocol for 
                  mobile ad hoc networks}, 
  journal =	 {Telecommunication Systems}, 
  year =	 2001, 
  volume =	 18, 
  pages =	 {61--84}, 
  annote =	 {GRID} 
} 
@Article{LTWW94, 
  author =	 {W. E. Leland and M.S. Taqqu and W. Willinger and 
                  D.V. Wilson}, 
  title =	 {On the Self-Similar Nature of Ethernet Traffic 
                  (Extended Version)}, 
  journal =	 ton, 
  year =	 1994, 
  volume =	 2, 
  number =	 1, 
  pages =	 {1--15}, 
  month =	 Feb, 
  url = 
                  {\url{http://www.acm.org/sigcomm/ccr/archive/1995/jan95/ccr-9501-leland.html}}, 
  ftp = 
                  {ftp://thumper.bellcore.com/pub/world/wel/sigcomm93.ps.Z} 
} 
@InProceedings{LV99, 
  author =	 {L. Lov{\'a}sz and K. Vesztergombi}, 
  title =	 {Geometric representations of graphs}, 
  booktitle =	 {Paul Erd{\~o}s and his Mathematics}, 
  year =	 1999, 
  address =	 {Budapest, Hugary}, 
  url =		 {\url{http://research.microsoft.com/users/lovasz/egrep.ps}} 
} 
@Article{LWF03, 
  author =	 {X.-Y. Li and P.-J. Wan and O. Frieder}, 
  title =	 {Coverage in Wireless Ad-Hoc Sensor Networks}, 
  journal =	 {IEEE Transactions on Computers}, 
  year =	 2003, 
  month =	 Jun, 
  url = 
                  {\url{http://ir.iit.edu/publications/downloads/117656-1.pdf}} 
} 
@Article{LWHS02, 
  author =	 {Dan Li and K. D. Wong and Yu Hen Hu and 
                  A. M. Sayeed}, 
  title =	 {Detection, classification, and tracking of targets}, 
  journal =	 {IEEE Signal Processing Magazine}, 
  year =	 2002, 
  volume =	 19, 
  number =	 2, 
  pages =	 {17--29}, 
  month =	 Mar, 
  annote =	 {location}, 
  url =		 {} 
} 
@InProceedings{LWWY03, 
  author =	 {Xiang-Yang Li and Peng-Jun Wan and Yu Wang and 
                  Chih-Wei Yi}, 
  title =	 {Fault Tolerant Deployment and Topology Control in 
                  Wireless Networks}, 
  crossref =	 {mobihoc03}, 
  year =	 {2003}, 
  month =	 Jun, 
  url = 
                  {\url{http://www.sigmobile.org/mobihoc/2003/papers/p117-li.pdf}} 
} 
@InProceedings{LY03, 
  author =	 {Yanbin Liu and Yang Richard Yang}, 
  title =	 {Reputation Propagation and Agreement in Mobile 
                  Ad-Hoc Networks}, 
  crossref =	 "wcnc03" 
} 
@InProceedings{LYBS00, 
  author =	 {Jeremy Lilley and Jason Yang and Hari Balakrishnan 
                  and Srinivasan Seshan }, 
  title =	 {A Unified Header Compression Framework for 
                  Low-Bandwidth Links}, 
  crossref =	 "mobicom00", 
  abstract =	 {Compressing protocol headers has traditionally been 
                  an attractive way of conserving bandwidth over 
                  low-speed links, including those in wireless 
                  systems. However, despite the growth in recent years 
                  in the number of end-to-end protocols beyond TCP/IP, 
                  header compression deployment for these protocols 
                  has not kept pace. This is in large part due to 
                  complexities in implementation, which often requires 
                  a detailed knowledge of kernel internals, and a lack 
                  of a common way of pursuing the general problem 
                  across a variety of end-to-end protocols. To address 
                  this, rather than defining several new 
                  protocol-specific standards, we present a unified 
                  framework for header compression. This framework 
                  includes a simple, platform-independent header 
                  description language that protocol implementors can 
                  use to describe high-level header properties, and a 
                  platform-specific code generation tool that produces 
                  kernel source code automatically from this header 
                  specification. Together, the high-level description 
                  language and code generator free protocol designers 
                  from having to understand any details of the target 
                  platform, enabling them to implement header 
                  compression with relatively little effort. We 
                  analyze the performance of compression produced 
                  using this framework for TCP/IP in the Linux 2.0 
                  kernel and demonstrate that unified, 
                  automatically-generated header compression without 
                  significant performance penalty is viable. } 
} 
@TechReport{LYGL00tech, 
  author =	 {Xiaozhou Li and Yang Richard Yang and Mohamed 
                  G. Gouda and Simon S. Lam}, 
  title =	 {Batch Updates of Key Trees}, 
  institution =	 utcs, 
  year =	 2000, 
  month =	 sep, 
  number =	 {TR--00--22} 
} 
@InProceedings{LYGL01, 
  author =	 {Xiaozhou Steve Li and Yang Richard Yang and Mohamed 
                  G. Gouda and Simon S. Lam}, 
  title =	 {Batch rekeying for secure group communications}, 
  booktitle =	 {Proceedings of Tenth International World Wide Web 
                  Conference ({WWW10})}, 
  year =	 2001, 
  month =	 May, 
  address =	 {Hong Kong, China} 
} 
@InProceedings{LZKL+02, 
  author =	 {Haiyun Luo and Petros Zerfos and Jiejun Kong and 
                  Songwu Lu and Lixia Zhang}, 
  title =	 {Self-securing ad-hoc wireless networks}, 
  booktitle =	 {{ISCC}}, 
  year =	 2002, 
  url = 
                  {\url{http://www.cs.ucla.edu/~jkong/publications/ISCC02.pdf}} 
} 
@article{Lam70, 
  author =	 {G. Laman}, 
  title =	 {On Graphs and Rigidity of Plane Skeletal Structures}, 
  journal =	 {Journal of Engineering Mathematics}, 
  year =	 2002, 
  volume =	 4, 
  pages =	 {331--340}, 
} 
@InProceedings{Lan01, 
  author =	 {M. Langheinrich}, 
  title =	 {Privacy by Design -- Principles of Privacy-Aware 
                  Ubiquitous Systems}, 
  booktitle =	 {Ubicomp}, 
  pages =	 {273--291}, 
  year =	 2001, 
  editor =	 {G. D. Abowd and B. Brumitt and S. A. Shafer,}, 
  volume =	 2201, 
  series =	 {Lecture Notes in Computer Science}, 
  publisher =	 {Springer}, 
  annote =	 {location} 
} 
@InProceedings{Lan02, 
  author =	 {M. Langheinrich}, 
  title =	 {A Privacy Awareness System for Ubiquitous Computing 
                  Environments}, 
  booktitle =	 {Ubicomp}, 
  pages =	 {237--245}, 
  year =	 2002, 
  editor =	 {G. Borriello and L. E. Holmquist}, 
  volume =	 2498, 
  series =	 {Lecture Notes in Computer Science}, 
  publisher =	 {Springer}, 
  annote =	 {location} 
} 
@Misc{Level3Crossroads, 
  author =	 {{Level 3 Communications Inc.}}, 
  title =	 {Crossroads Internet Access}, 
  howpublished = {see \url{http://www.level3.com/us/services/crossroads/}}, 
  month =	 Aug, 
  year =	 2000, 
  url =		 {\url{http://www.thedigest.com/more/119/119-73.html}} 
} 
@InCollection{Li03, 
  author =	 {Xiang-Yang Li}, 
  editor =	 {XiuZhen Cheng and Xiao Huang and Ding-Zhu Du}, 
  title =	 {Applications of Computational Geometry in Wireless 
                  Ad Hoc Networks}, 
  booktitle =	 {Ad Hoc Wireless Networking}, 
  publisher =	 {Kluwer}, 
  year =	 2003, 
  url = 
                  {\url{http://www.csam.iit.edu/~xli/paper/Journal/du-survey-final.ps}} 
} 
@Misc{Lin02, 
  author =	 {Jeb Linton}, 
  title =	 {New Directions in Peering for Tier-2 and Content 
                  Providers}, 
  howpublished = {{NANOG24} Meeting: available at 
                  \url{http://www.nanog.org/mtg-0202/ppt/linton.ppt}}, 
  month =	 Feb, 
  year =	 2002, 
  annote =	 {} 
} 
@Misc{Lin02, 
  author =	 {Jeb Linton}, 
  title =	 {New Directions in Peering for Tier-2 and Content 
                  Providers, {NANOG24} Meeting}, 
  howpublished = {\url{http://www.nanog.org/mtg-0202/ppt/linton.ppt}}, 
  month =	 Feb, 
  year =	 2002 
} 
@Article{Lju77, 
  author =	 {L. Ljung}, 
  title =	 {Analysis of recursive stochastic algorithms}, 
  journal =	 {IEEE Transactions on Automatic Control}, 
  year =	 1997, 
  volume =	 22, 
  number =	 4, 
  pages =	 {551--575}, 
  month =	 Aug, 
  url = 
                  {} 
} 
@Article{Llo82, 
  author =	 {S. P. Lloyd}, 
  title =	 {Least squares quantization in {PCM}}, 
  journal =	 {{IEEE} Transactions on Information Theory}, 
  year =	 1982, 
  volume =	 28, 
  number =	 2, 
  pages =	 {129--137}, 
  note =	 {Presented as Bell Laboratory Technical Memorandum at 
                  a 1957 Institute for Mathematical Statistics 
                  meeting.} 
} 
@article{Lov82, 
  author =	 {L. Lovasz and Y. Yemini}, 
  title =	 {On generic rigidity in the plane}, 
  journal =	 {{SIAM} J. Alg. Disc. Meth.}, 
  year =	 1982, 
  volume =	 3, 
  pages =	 {91--98} 
} 
@InCollection{Lov96, 
  author =	 {L. Lov{\'a}sz}, 
  editor =	 {D. Mikl{\'o}s and V. T. S{\'o}s and T. Sz{\~o}nyi}, 
  booktitle =	 {Paul Erd{\~o}s is Eighty}, 
  title =	 {Random Walks on Graphs: A Survey}, 
  publisher =	 {J{\'a}nos Bolyai Mathematical Society}, 
  year =	 1996, 
  pages =	 {353--398}, 
  url = 
                  {\url{http://research.microsoft.com/users/lovasz/erdos.ps}} 
} 
@InProceedings{Low00, 
  author =	 "S. Low", 
  title =	 "A Duality Model of {TCP} and Queue Management 
                  Algorithms", 
  booktitle =	 "Proceedings of {ITC} Specialist Seminar on {IP} 
                  Traffic Measurement, Modeling and Management", 
  month =	 Sep} 
@InProceedings{Low99, 
  author =	 {Steve Low}, 
  title =	 {Optimization Flow Control with On-line Measurement}, 
  booktitle =	 {Proceedings of the 16th International Teletraffic 
                  Congress}, 
  address =	 {Edinburgh, UK}, 
  month =	 jun, 
  year =	 {1999}, 
  abstract =	 {Use pricing for congestion control} 
} 
@Book{Lyn96, 
  author =	 {Nancy Lynch}, 
  title =	 {Distributed Algorithms}, 
  publisher =	 {Morgan Kaufmann Publishers}, 
  year =	 1996, 
  address =	 {San Mateo, CA}, 
  url =		 {\url{http://theory.lcs.mit.edu/tds/distalgs.html}} 
} 
@PhdThesis{M96, 
  author =	 {Steve McCanne}, 
  title =	 {Scalable Compression and Transmission of {I}nternet 
                  Multicast Video}, 
  school =	 {University of California, Berkeley}, 
  year =	 1996, 
  month =	 dec 
} 
@InProceedings{MB00, 
  author =	 {Biswaroop Mukherjee and Tim Brecht}, 
  title =	 {Time-lined {TCP} for the {TCP}-friendly delivery of 
                  streaming media}, 
  crossref =	 "icnp00", 
  abstract =	 {In their approach, the sender specifies deadline for 
                  each data segment, so that the transport layer drops 
                  expired segments in the buffer.} 
} 
@Article{MB76, 
  author =	 {B. Metcalfe and D. Boggs}, 
  title =	 {{ETHERNET}: Distributed Packet Switching for Local 
                  Area Networks}, 
  journal =	 cacm, 
  year =	 {1976}, 
  abstract =	 {} 
} 
@InProceedings{MCGSW01, 
  author =	 {Saverio Mascolo and Claudio Casetti and Mario Gerla 
                  and Medy Sanadidi and Ren Wang}, 
  title =	 {TCP Westwood: End-to-End Bandwidth Estimation for 
                  Efficient Transport over Wired and Wireless 
                  Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {TCP Westwood (TCPW) is a sender-side modification of 
                  the TCP congestion window algorithm that improves 
                  upon the performance of TCP Reno in wireline as well 
                  as wireless networks. The improvement is most 
                  significant in wireless networks with lossy links, 
                  since TCP Westwood relies on end-to-end bandwidth 
                  estimation to discriminate the cause of packet loss 
                  (congestion or wireless channel effect) which is a 
                  major problem in TCP Reno. An important 
                  distinguishing feature of TCP Westwood with respect 
                  to previous wireless TCP extensions is that it does 
                  not require inspection and/or interception of TCP 
                  packets at intermediate (proxy) nodes. Rather, it 
                  fully complies with the end-to-end TCP design 
                  principle. The key innovative idea is to 
                  continuously measure at the TCP source the rate of 
                  the connection by monitoring the rate of returning 
                  ACKs. The estimate is then used to compute 
                  congestion window and slow start threshold after a 
                  congestion episode, that is, after three duplicate 
                  acknowledgments or after a timeout. The rationale of 
                  this strategy is simple: in contrast with TCP Reno, 
                  which blindly halves the congestion window after 
                  three duplicate ACKs, TCP Westwood attempts to 
                  select a slow start threshold and a congestion 
                  window which are consistent with the effective 
                  bandwidth used at the time congestion is 
                  experienced. We call this mechanism faster 
                  recovery. The proposed mechanism is particularly 
                  effective over wireless links where sporadic losses 
                  due to radio channel problems are often 
                  misinterpreted as a symptom of congestion by current 
                  TCP schemes and thus lead to an unnecessary window 
                  reduction. Experimental studies reveal improvements 
                  in throughput and performance, as well as in 
                  fairness. In addition, friendliness with TCP Reno 
                  was observed in a set of experiments showing that 
                  TCP Reno connections are not starved by new coming 
                  TCPW connections. Most importantly, TCPW is 
                  extremely effective in mixed wired and wireless 
                  networks where throughput improvements of up to 
                  550\% are observed. Finally, TCPW performs almost as 
                  well as localized link layer approaches such as the 
                  popular Snoop scheme, without incurring the O/H of a 
                  specialized link layer protocol.} 
} 
@manual{MD5, 
  author =	 {Ronald L. Rivest}, 
  title =	 {The {MD5} Message Digest Algorithm, {RFC} 1321}, 
  month =	 Apr, 
  year =	 1992, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1321.htm}} 
} 
@InProceedings{MD88, 
  author =	 {Paul V. Mockapetris and Kevin J. Dunlap}, 
  title =	 {Development of the Domain Name System}, 
  crossref =	 {sigcomm88}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/ccr/archive/1995/jan95/ccr-9501-mockapet.html}} 
} 
@TechReport{MF01, 
  author =	 {R. Mahajan and S. Floyd}, 
  title =	 {Controlling High Bandwidth Flows at the Congested 
                  Router}, 
  institution =	 {ICSI}, 
  year =	 2001, 
  number =	 {TR--01--001}, 
  address =	 {Berkeley, CA}, 
  month =	 Apr, 
  url =		 {\url{http://www.aciri.org/floyd/talks/ACIRI-Dec00.pdf}} 
} 
@Unpublished{MF97, 
  author =	 {J. Mahdavi and S. Floyd}, 
  title =	 {{TCP}-Friendly Unicast rate-based Flow Control}, 
  note =	 {Note sent to the end2end-interest mailing list}, 
  year =	 1997, 
  abstract =	 {}, 
  annote =	 {congestion control} 
}, 
  year =	 2000, 
  address =	 "Monterey, CA.", 
  url =		 {} 
} 
@Article{MFD03, 
  author =	 {Ginger Myles and Adrian Friday and Nigel Davies}, 
  title =	 {Preserving Privacy in Environments with 
                  Location-Based Applications}, 
  journal =	 {{IEEE} Pervasive Computing}, 
  year =	 2003, 
  annote =	 {location; tracking during work, at amusement park at 
                  the park} 
} 
@InProceedings{MWA05, 
  author =	 {Ratul Mahajan and David Wetherall and Thomas Anderson}, 
  title =	 { Negotiation-Based Routing Between Neighboring Domains}, 
  crossref =	 "nsdi05", 
  annote =	 {BGP} 
} 
@InProceedings{MFW01, 
  author =	 {Ratul Mahajan and Sally Floyd and David Wetherall}, 
  title =	 {Controlling High-Bandwidth Flows at the Congested 
                  Routers}, 
  crossref =	 "icnp01", 
  url =		 {\url{http://www.cs.washington.edu/homes/ratul/red-pd/}}, 
  annote =	 {congestion control} 
} 
@InProceedings{MGLB00, 
  author =	 {Sergio Marti and Thomas Giuli and Kevin Lai and Mary 
                  Baker}, 
  title =	 {Mitigating Routing Misbehavior in Mobile Ad Hoc 
                  Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {This paper describes two techniques that improve 
                  throughput in an ad hoc network in the presence of 
                  nodes that agree to forward packets but fail to do 
                  so. To mitigate this problem, we propose 
                  categorizing nodes based upon their dynamically 
                  measured behavior. We use a watchdog that identifies 
                  misbehaving nodes and a pathrater that helps routing 
                  protocols avoid these nodes. Through simulation we 
                  evaluate watchdog and pathrater using packet 
                  throughput, percentage of overhead (routing) 
                  transmissions, and the accuracy of misbehaving node 
                  detection. When used together in a network with 
                  moderate mobility, the two techniques increase 
                  throughput by 16\% in the presence of 40\% 
                  misbehaving nodes, while increasing the percentage 
                  of overhead transmissions from the standard routing 
                  protocol's 8\% to 16\%. During extreme mobility, 
                  watchdog and pathrater can increase network 
                  throughput by 30\%, while increasing the overhead 
                  transmissions from the standard routing protocol's 
                  11\% to 24\%. }, 
  url = 
                  {\url{http://gunpowder.stanford.edu/~laik/projects/adhoc/mitigating.pdf}} 
} 
@InProceedings{MGS02, 
  author =	 {Andrej Mihailovic and Gosta Leijonhufvud and Tapio 
                  Suihko}, 
  title =	 {Providing Multi-Homing Support in {IP} Access 
                  Networks}, 
  url =		 {}, 
  booktitle =	 {{PIMRC} 2002}, 
  year =	 2002 
} 
@InProceedings{MGT00, 
  author =	 {V. Misra and W. Gong and D. Towsley}, 
  title =	 {A Fluid-based Analysis of a Network of {AQM} Routers 
                  Supporting {TCP} Flows with an Application to {RED}}, 
  crossref =	 {sigcomm00}, 
  url =		 {ftp://gaia.cs.umass.edu/pub/Misra00_AQM.ps.gz} 
} 
@Article{MH00, 
  author =	 {Martin Mauve and Volker Hilt } , 
  title =	 {An application developer's perspective on reliable 
                  multicast for distributed interactive media} , 
  journal =	 ccr, 
  volume =	 30, 
  number =	 3, 
  year =	 2000 , 
  month =	 Jul 
} 
@manual{MH99, 
  author =	 {Monga, Indermohan and Hardjono, Thomas}, 
  title =	 {Group Secuirty Association ({GSA}) Definition for 
                  {IP} Multicast, INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 Feb, 
  url =		 {\url{http://www.ipmulticast.com/community/smug/}}, 
  abstract =	 {In unicast IPSec, the receiver and the sender 
                  negotiate the SA parameters, and the receiver 
                  decides the SPI. For IP Multicast, who make the 
                  decision: this paper propose either the sender or 
                  some other service providers, e.g. Key 
                  Server. Whichever provides the SPI and SA 
                  parameters, receivers use (SrcAddr, SPI, Protcol) 
                  tuple to identify the SA. There are 4 advantages: 
                  1. it works for 1-m, which is the IP multicast 
                  application demands; 2. current IPSec implementation 
                  will not need to be changed. Access SA Database 
                  (SAD) will not change 3. Some multicast protocol 
                  will only admit the creation of 1-m multicast groups 
                  (PIMv2), this provides sender-authentication 
                  4. IPSec anti-replay feature can be used because 
                  different sender's packet will not be mixed. But 
                  frankly, I do not agree with the point of view in 
                  this paper. First, consider the 1-m case, in this 
                  case, why do we want to use source address, 
                  destination address will do the same job, no pint to 
                  change the IPSec. Second, in the m-m case, in this 
                  case, using source address will make selecting SPI 
                  easier because each source can select their own SPI, 
                  the above approach provides a distributed selection 
                  possible, they may select the same SPI, however, if 
                  we think they use the same parameter, the parameter 
                  will have to be passed to the senders, we need a 
                  central control point anyway, why bother let each 
                  sender to select SPI. } 
} 
@Article{MHKE01, 
  author =	 {M. Mauve and V. Hilt and C. Kuhmunch and 
                  W. Effelsberg}, 
  title =	 {{RTP}/{I}-toward a common application level protocol 
                  for distributed interactive media}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {} 
} 
@InProceedings{MIMEH96, 
  author =	 {N. McKeown and M. Izzard and A. Mekkittikul and 
                  W. Ellersick and M. Horowitz}, 
  title =	 {The Tiny Tera: A Packet Switch Core}, 
  booktitle =	 {Proceedings of Hot Interconnects {V}}, 
  year =	 1996, 
  address =	 {Stanford University, CA}, 
  month =	 Aug, 
  url = 
                  {\url{http://klamath.stanford.edu/tiny-tera/papers/papers/HOTI_96.pdf}} 
} 
@Misc{MINC, 
  key =		 {Multicast-based inference of Network Internal 
                  Characteristics (MINC)}, 
  author =	 {{Multicast-based inference of Network Internal 
                  Characteristics (MINC)}}, 
  howpublished = {\url{http://gaia.cs.umass/min/}} 
} 
@InProceedings{MJ00, 
  author =	 {Patrick McDaniel and Sugih Jamin}, 
  title =	 {Windowed Certificate Revocation}, 
  crossref =	 "infocom00", 
  abstract =	 {use lease}, 
  url =		 {} 
} 
@InProceedings{MJV96, 
  author =	 {S. McCanne and V. Jacobson and M. Vetterli}, 
  title =	 {Receiver Driven Layered Multicast}, 
  crossref =	 "sigcomm96", 
  abstract =	 {propose RLM}, 
  url =		 {ftp://ftp.ee.lbl.gov/papers/mccanne-sigcomm96.ps.gz} 
} 
@manual{MKPM88, 
  title =	 {{IP MTU} Discovery Options, {RFC} 1063}, 
  author =	 {J. Mogul and C. Kent and C. Patridge and 
                  K. McCloghrie}, 
  year =	 {1988}, 
  month =	 Jul, 
  abstract =	 {}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1063.html}} 
} 
@manual{BGP, 
  title =	 {A Border Gateway Protocol 4 ({BGP}-4), {RFC} 1771}, 
  author =	 {Y. Rekhter and T. Li}, 
  year =	 {1995}, 
  month =	 Mar, 
  abstract =	 {}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1771.html}} 
} 
@inproceedings{MKPS01, 
  author =	 "Seapahn Meguerdichian and Farinaz Koushanfar and 
                  Miodrag Potkonjak and Mani B. Srivastava", 
  title =	 "Coverage Problems in Wireless Ad-hoc Sensor 
                  Networks", 
  crossref =	 "infocom01", 
  pages =	 "1380--1387", 
  year =	 2001, 
  url = 
                  {} 
} 
@InProceedings{MKQP01, 
  author =	 {Seapahn Meguerdichian and Farinaz Koushanfar and 
                  Gang Qu and Miodrag Potkonjak}, 
  title =	 {Exposure In Wireless Ad-hoc Sensor Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {Wireless ad-hoc sensor networks will provide one of 
                  the missing connections between the Internet and the 
                  physical world. Calculation of exposure is one of 
                  fundamental problem in wireless sensor 
                  networks. Exposure is a measure of how well an 
                  object in a sensor network can be observed over a 
                  period of time as it moves along an arbitrary path 
                  with arbitrary velocities. In addition to this 
                  informal definition, we formally define exposure and 
                  study its properties. We have developed an 
                  effi-cient and effective algorithm for exposure 
                  calculation in sen-sor networks for any given 
                  distribution of sensors, sensor and intensity 
                  models, and characteristic of the network. The 
                  algorithm provides an unbounded level of accuracy as 
                  a function of run time. Furthermore, we study the 
                  relationship between location discovery, deployment, 
                  and exposure. We define and solve several 
                  combinatorial optimization problems related to 
                  exposure using integer linear programming. Fi-nally, 
                  we study the scaling behavior of exposure and the 
                  de-veloped algorithm for its calculation using 
                  statistical tech-niques.}, 
  url = 
                  {} 
} 
@Article{MKT98, 
  author =	 {Sue B. Moon and Jim Kurose and Don Towsley}, 
  title =	 {Packet audio playout delay adjustment: performance 
                  bounds and algorithms}, 
  journal =	 {Multimedia Systems}, 
  year =	 1998, 
  month =	 Jan, 
  volume =	 6, 
  number =	 1, 
  abstract =	 {The playout delay (packet delay + buffering delay) 
                  cannot exceed 400ms, due to the fact that the 
                  excessively long delay can significantly impairs 
                  human conversation. Adjusting the playout delay on a 
                  per-packet basis would lead to very jittery plaout, 
                  therefore, a good adjustment time is on a 
                  per-talkspurt basis. By talkspurt, we mean any 
                  contiguous period of audio activity between two 
                  period of silence} 
} 
@InProceedings{MLAW99, 
  author =	 {Jeonghoon Mo and Richard J. La and Venkat Anantharam 
                  and Jean C. Walrand}, 
  title =	 {Analysis and Comparison of {TCP} {R}eno and {V}egas}, 
  crossref =	 {infocom99}, 
  pages =	 {1556--1563}, 
  year =	 1999, 
  url =		 {}, 
  abstract =	 {propose some improvements of TCP Vegas and compare 
                  its performance characteristics in comparison with 
                  TCP Reno. We demonstrate through analysis that TCP 
                  Vegas, with its better bandwidth estimation scheme, 
                  uses the network resources more efficiently and is 
                  more fair than TCP Reno. Simulation results are 
                  given and support the results of the analysis. } 
} 
@InProceedings{MLLY04, 
  author =	 {Richard T.B. Ma and Sam C.M. Lee and John C.S. Lui 
                  and David K.Y. Yau}, 
  title =	 {A Game Theoretic Approach to Provide Incentive and 
                  Service Differentiation in P2P Networks}, 
  crossref =	 {sigmetrics04} 
} 
@InProceedings{MLYC95, 
  author =	 {C. Ma and W. Li and Y. Yang and L. Chang}, 
  title =	 {Robot motion planning with many degrees of freedom}, 
  booktitle =	 {IEEE International Conference on Systems, Man and 
                  Cybernetics '95}, 
  year =	 1995, 
  month =	 oct, 
  abstract =	 {Because a robot usually operates in environments 
                  with uncertain information, path planning for the 
                  robot should be performed in real-time so as to 
                  match process speed based on sensors. This paper 
                  presents an efficient approach to behavior based 
                  motion planning of a manipulator with many degrees 
                  of freedom, which is based on an algorithm for fast 
                  mapping obstacles from a robot's workspace (W-space) 
                  into its configuration space (C-space). In the 
                  paper, several types of behaviors are defined to 
                  formulate the manipulator motion, while rules of 
                  choosing behaviors are also given. The proposed 
                  method is suitable for the requirement on real-time 
                  robot path planning in uncertain environments.} 
} 
@InProceedings{MM01, 
  author =	 {Philip K. McKinley and Arun P. Mani}, 
  title =	 {An Experimental Study of Adaptive Forward Error 
                  Correction for Wireless Collaborative Computing}, 
  booktitle =	 {Proceedings of the 2001 IEEE Symposium on 
                  Applications and the Internet (SAINT-2001)}, 
  year =	 2001, 
  month =	 Jan, 
  address =	 {San Diego, CA} 
} 
@InProceedings{MM02, 
  author =	 {Pietro Michiardi and Refik Molva}, 
  title =	 {{Core}: A COllaborative REputation mechanism to 
                  enforce node cooperation in Mobile Ad Hoc Network}, 
  booktitle =	 {Communications and Multimedia Security Conference 
                  ({CMS}) 2002}, 
  year =	 2002, 
  address =	 {Portoroz}, 
  month =	 Sep, 
  url =		 {\url{http://www.eurecom.fr/~michiard/pub.html}} 
} 
@InProceedings{MM02:simulation, 
  author =	 {Pietro Michiardi and Refik Molva}, 
  title =	 {Simulation-based Analysis of Security Exposures in 
                  Mobile Ad Hoc Networks}, 
  booktitle =	 {European Wireless 2002 Conference}, 
  year =	 2002, 
  address =	 {Florence, Italy}, 
  month =	 Feb, 
  url = 
                  {\url{http://www.eurecom.fr/%7Emichiard/pub/michiardi\_adhoc\_selfishness.pdf}} 
} 
@InProceedings{MM96, 
  author =	 {Matt Mathis and Jamshid Mahdavi}, 
  title =	 {Forward Acknowledgment: Refining {TCP} Congestion 
                  Control}, 
  crossref =	 "sigcomm96", 
  url = 
                  {ftp://ftp.psc.edu/pub/networking/papers/Fack.9608.ps} 
} 
@Misc{MPLS, 
  key =		 "MPLS", 
  title =	 {Multiprotocol Label Switching ({MPLS})}, 
  howpublished = {\url{http://www.ietf.org/html.charters/mpls-charter.html}} 
} 
@InProceedings{MQ98, 
  author =	 {Jeonghoon Mo and Jean Walrand}, 
  title =	 {Fair End-to-End Window-based Congestion Control }, 
  booktitle =	 {Proceedings of {SPIE} '98 Performance and Control of 
                  Network Systems II}, 
  year =	 1998, 
  address =	 {Boston, MA}, 
  month =	 Nov, 
  url =		 {} 
} 
@article{MR92, 
  author =	 {G. L. Miller and V. Ramachandran}, 
  title =	 {A new graph triconnectivity algorithm and its 
                  parallelization}, 
  journal =	 {Combinatorica}, 
  year =	 1992, 
  volume =	 12, 
  pages =	 {53--76}, 
} 
@manual{MRBP98, 
  author =	 {Mankin, A. and Romanow, A. and Bradner, S. and 
                  Paxson, V.}, 
  title =	 {{IETF} Criteria for Evaluating Reliable Multicast 
                  Transport and Application Protocols, {RFC} 2357}, 
  year =	 {1998}, 
  month =	 jun, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2357.html}} 
} 
@manual{MRR99, 
  author =	 {M. J. Moyer and J. R. Rao and P. Rohatgi}, 
  title =	 {Maintaining Balanced Key Trees for Secure Multicast, 
                  INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 jun, 
  abstract =	 {} 
} 
@misc{MSKP01, 
  author =	 "Seapahn Meguerdichian and Sasa Slijepcevic and Vahag 
                  Karayan and Miodrag Potkonjak", 
  title =	 "Localized Algorithms In Wireless Ad-Hoc Networks: 
                  Location Discovery And Sensor Exposure", 
  url = 
                  {} 
} 
@Article{MSMO97, 
  author =	 {M. Mathis and J. Semke and J. Mahdavi and T. Ott}, 
  title =	 {The Macroscopic Behavior of the {TCP} Congestion 
                  Avoidance Algorithm}, 
  journal =	 ccr, 
  year =	 {1997}, 
  volume =	 {27}, 
  number =	 {3}, 
  pages =	 {67--82}, 
  month =	 Jul, 
  abstract =	 {TCP Modeling} 
} 
@Article{MV95, 
  author =	 {J. K. MacKie-Mason and H. R. Varian}, 
  title =	 {Pricing Congestible Network Resources}, 
  journal =	 jsac, 
  year =	 1995, 
  volume =	 13, 
  number =	 7, 
  pages =	 {1141--1149}, 
  month =	 Sep, 
  note =	 {In MacKie-Mason and Varian (1994a) we proposed a way 
                  to price network usage that we called smart 
                  markets. Much of the time the network is 
                  uncongested; at such times the price for usage 
                  should be zero. However, when the network is 
                  congested, packets are queued, delayed, and 
                  dropped. The current queuing scheme is FIFO.We 
                  propose instead that packets should be prioritized 
                  based on the value that the user puts on getting the 
                  packet through quickly. To do this, each user 
                  assigns her packets a bid measuring her 
                  willingness-to-pay for immediate servicing. At 
                  congested routers, packets are prioritized based on 
                  bids. In order to make the scheme 
                  incentive-compatible, users are not charged the 
                  price they bid, but rather are charged the bid of 
                  the highest priority packet that is not admitted to 
                  the network. It can be shown that this mechanism 
                  provides the right incentives for users to reveal 
                  their true priority.}, 
  url = 
                  {\url{http://www.sims.berkeley.edu/~hal/Papers/pricing-congestible.pdf}} 
} 
@Article{MW97, 
  author =	 {J. More and Z. Wu}, 
  title =	 {Global continuation for distance geometry problems}, 
  journal =	 {{SIAM} Journal on Optimization}, 
  year =	 1997, 
  volume =	 7, 
  pages =	 {814--836}, 
  abstract =	 {}, 
  annote =	 {apply Gaussian transformation on the cost function 
                  to smooth out the cost function; then apply gradient 
                  algorithms for solution.}, 
  url =		 {} 
} 
@Book{MWG95, 
  author =	 {Andreu Mas-Colell and Michael D. Whinston and Jerry 
                  R. Green}, 
  title =	 {Microeconomic Theory}, 
  publisher =	 {Oxford Press}, 
  year =	 1995 
} 
@InProceedings{MWJH00, 
  author =	 {G. Robert Malan and David Watson and Farnam Jahanian 
                  and Paul Howell}, 
  title =	 {Transport and Application Protocol Scrubbing}, 
  crossref =	 "infocom00", 
  url =		 {} 
} 
@InProceedings{Ma00, 
  author =	 {Christian Maihofer}, 
  title =	 {A Bandwidth Analysis of Reliable Multicast Transport 
                  Protocol}, 
  booktitle =	 {Proceedings of Networked Group Communication'00}, 
  year =	 {2000}, 
  address =	 {Standford, CA}, 
  month =	 nov 
} 
@TechReport{Mas00, 
  author =	 {L. Massoulie}, 
  title =	 {Stability of Distributed Congestion Control with 
                  Heterogeneous Feedback Delays}, 
  institution =	 {Microsoft Research}, 
  year =	 2000, 
  month =	 Nov, 
  url = 
                  {\url{http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2000-111}} 
} 
@manual{Mil83, 
  author =	 {D. Mills}, 
  title =	 {{I}nternet Delay Experiments, {RFC} 889}, 
  month =	 dec, 
  year =	 1983, 
  abstract =	 {Has made two points: 1) use different \alpha for TCP 
                  delay estimation. 2) Notice spikes in delays}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc1063.html}} 
} 
@InProceedings{Mil88, 
  author =	 {D. L. Mills}, 
  title =	 {The {F}uzzball}, 
  crossref =	 "sigcomm88", 
  abstract =	 {Software router} 
} 
@manual{Mills00, 
  author =	 {David L. Mills}, 
  title =	 {Public-Key Cryptography for the Network Time 
                  Protocol, Version 1, INTERNET-DRAFT}, 
  month =	 jun, 
  year =	 2000 
} 
@manual{Mills92, 
  author =	 {David L. Mills}, 
  title =	 {Network Time Protocol (Version 3) Specification, 
                  Implementation and Analysis, {RFC} 1305}, 
  year =	 {1992}, 
  month =	 Mar 
} 
@Misc{Mis99, 
  author =	 {Padmini Misra}, 
  title =	 {Routing Protocols for Ad Hoc Mobile Wireless 
                  Networks}, 
  howpublished = {Available at: 
                  ftp://ftp.netlab.ohio-state.edu/pub/jain/courses/cis788-99/adhoc\_routing/index.html}, 
  year =	 1999, 
  url = 
                  {ftp://ftp.netlab.ohio-state.edu/pub/jain/courses/cis788-99/adhoc\_routing/index.html} 
} 
@InProceedings{Mit97, 
  author =	 {Mittra, S.}, 
  title =	 {Iolus: A Framework for scalable Secure Multicasting}, 
  crossref =	 "sigcomm97", 
  abstract =	 {Hierarchy trees of agents} 
} 
@Misc{Mobiloco, 
  key =		 {Mobiloco}, 
  title =	 {Mobiloco - Location Based Services for Mobile 
                  Communities}, 
  howpublished = {\url{http://www.mobiloco.de}}, 
  annote =	 {location; locate friends using cell phone} 
} 
@InProceedings{Mog95, 
  author =	 {Jeffrey C. Mogul}, 
  title =	 {A case for Persistent-Connection {HTTP}}, 
  crossref =	 "sigcomm95", 
  abstract =	 {}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm95/papers/mogul.html}} 
} 
@Article{Mon83, 
  author =	 {W. Montgomery}, 
  title =	 {Techniques for packet voice synchronization}, 
  journal =	 jsac, 
  volume =	 {6}, 
  number =	 {1}, 
  pages =	 {1022--1028}, 
  year =	 1983, 
  month =	 dec, 
  abstract =	 {Propose the absolute timing method} 
} 
@TechReport{Mon97, 
  author =	 {Montgomery T.}, 
  title =	 {A Loss Tolerant Rate Controller for Reliable 
                  Multicast}, 
  institution =	 {NASA-IVV-97-011}, 
  year =	 {1997}, 
  month =	 aug, 
  abstract =	 {} 
} 
@InProceedings{Mor00, 
  author =	 {Robert Morris}, 
  title =	 {Scalable {TCP} Congestion Control}, 
  crossref =	 "infocom00", 
  abstract =	 {Buffer size should be proportional to number of 
                  flows} 
} 
@Book{Mou95, 
  author =	 {H. Moulin}, 
  title =	 {Cooperative Microeconomics: A Game-Theoretic 
                  Introduction}, 
  publisher =	 {Princeton University Press}, 
  year =	 1995 
} 
@Article{Muk94, 
  author =	 {A. Mukherjee}, 
  title =	 {On the Dynamics and Significance of Low Frequency 
                  Components of {I}nternet Load}, 
  journal =	 {Internetworking: Research and Experience}, 
  year =	 1994, 
  volume =	 5, 
  pages =	 {163--205}, 
  month =	 Dec, 
  url =		 {}, 
  note =	 {Mukherjee found that packet delay along several 
                  Internet paths was well modeled using a shifted 
                  gamma distribution, but the parameters of the 
                  distribution varied from path to path and on time 
                  scales of hours} 
} 
@Article{Mur70, 
  author =	 {J.D. Murchland}, 
  title =	 {Braess's Paradox of Traffic Flow}, 
  journal =	 {Transportation Research}, 
  year =	 1970, 
  number =	 4, 
  pages =	 {391--394} 
} 
@InProceedings{N00, 
  author =	 {Zohar Naor}, 
  title =	 {Tracking Mobile Users with Uncertain Parameters}, 
  crossref =	 "mobicom00", 
  abstract =	 {A method of reducing the wireless cost of tracking 
                  mobile users with uncertain parameters is developed 
                  in this paper. Such uncertainty arises naturally in 
                  wireless networks, since an efficient user tracking 
                  is based on a prediction of its future call and 
                  mobility parameters. The conventional approach based 
                  on dynamic tracking is not reliable in the sense 
                  that inaccurate prediction of the user mobility 
                  parameters may significantly reduce the tracking 
                  efficiency. Unfortunately, such uncertainty is 
                  likely to be expected for mobile users, especially 
                  for bursty mobility pattern. In this study we 
                  propose a novel approach, which is efficient yet 
                  reliable. The basic idea is to incorporate a 
                  distributed scheme with a centralized scheme. The 
                  location update process incorporates a 
                  topology-independent distance based strategy and a 
                  load-sensitive timer. This combination forms a 
                  mechanism that bounds from above the total tracking 
                  cost. The registration activity is governed by the 
                  system, such that it increases at lowly loaded cells 
                  and decreases at heavily loaded cells. The expected 
                  wireless cost of tracking under the proposed method 
                  is significantly reduced, in comparison to the 
                  existing methods currently used in cellular 
                  networks. Furthermore, as opposed to other tracking 
                  methods, the worst case tracking cost is bounded 
                  from above and governed by the system. The proposed 
                  strategy can be easily implemented, and it does not 
                  require a significant computational power from the 
                  user. } 
} 
@Unpublished{N99, 
  author =	 {R. Nagpal}, 
  title =	 {Organizing a Global Coordinate System from Local 
                  Information on an Amorphous Computer, AI Memo, MIT 
                  AI lab}, 
  annote =	 {Distance vector coarse grained localization}, 
  year =	 {1999}, 
} 
@InProceedings{NB96, 
  author =	 {Nonnenmacher, J. and Biersack, E.}, 
  title =	 {Reliable Multicast: Where to use {FEC}}, 
  booktitle =	 {Proc. 5th. Workshop on Protocols for High Speed 
                  Networks}, 
  year =	 {1996}, 
  month =	 oct, 
  address =	 {Sophia Antipolis, France}, 
  abstract =	 {Want to know where FEC performs the best: LAN, or 
                  WAN.} 
} 
@InProceedings{NB98, 
  author =	 {J. Nonnenmacher and E. Biersack}, 
  title =	 {Scalable Optimal Multicast Feedback}, 
  crossref =	 "infocom98", 
  abstract =	 {use expeonential} 
} 
@InProceedings{NBT97, 
  author =	 {Nonnenmacher, J. and Biersack, E. and Towsley, D.}, 
  title =	 {Parity-Based Loss Recovery for Reliable Multicast 
                  Transmission}, 
  crossref =	 "sigcomm97", 
  abstract =	 {Compare the number of transmissions per packet 
                  before all members have received it (avg) vs. number 
                  of receivers. The paper defines two approaches: 
                  Layered, and Integrated FEC. In Layered FEC, there 
                  is a FEC layer belows RM layer, the sender will 
                  sends k+h packets, and the FEC layer will be 
                  responsible to solve the missing packets form the 
                  parity packets. In the integrated approach, the 
                  sender will just send out a (<h) of the parity 
                  packet, when retransmission requests come in, it 
                  will send one more parity packet.} 
} 
@manual{NJZ99, 
  title =	 {Two-bit differentiated services architecture for the 
                  {I}nternet, {RFC} 2638}, 
  author =	 {K. Nichols and V. Jacobson and L. Zhang}, 
  year =	 1999, 
  abstract =	 {diffserv}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2638.html}} 
} 
@InProceedings{NK96, 
  author =	 {G.T. Nguyen and R. Katz}, 
  title =	 {A Trace-based Approach for Modeling Wireless Channel 
                  Behavior}, 
  booktitle =	 {Proceedings of the Winter Simulation Conference}, 
  year =	 1996 
} 
@InProceedings{NKGB00, 
  author =	 {T. Nandagopal and T. Kim and X. Gao and 
                  V. Bharghavan}, 
  title =	 {Achieving mac layer fairness in wireless packet 
                  networks}, 
  crossref =	 {mobicom00}, 
  abstract =	 {Link-layer fairness models that have been proposed 
                  for wireline and packet cellular networks cannot be 
                  generalized for shared channel wireless networks 
                  because of the unique characteristics of the 
                  wireless channel, such as location-dependent 
                  contention, inherent conflict between optimizing 
                  channel utilization and achieving fairness, and the 
                  absence of any centralized control. In this paper, 
                  we propose a general analytical framework that 
                  captures the unique characteristics of shared 
                  wireless channels and allows the modeling of a large 
                  class of system-wide fairness models via the 
                  specification of per-flow utility functions. We show 
                  system-wide fairness can be achieved without 
                  explicit global coordination so long as each node 
                  executes a contention resolution algorithm that is 
                  designed to optimize its local utility function. We 
                  present a general mechanism for translating a given 
                  fairness model in our framework into a corresponding 
                  per-node backoff-based collision resolution 
                  algorithm. Using this translation, we derive the 
                  backoff algorithm for achieving proportional 
                  fairness in wireless shared channels, and compare 
                  the performance of this algorithm with both the 
                  ideal proportional fairness objective, and 
                  state-of-the-art backoff-based contention resolution 
                  algorithms from related literature. We believe that 
                  the two aspects of the proposed framework, i.e. the 
                  ability to specify arbitrary fairness models via 
                  local utility functions, and the ability to 
                  automatically generate local collision resolution 
                  mechanisms in response to a given utility function, 
                  together provide the path for achieving flexible 
                  service differentiation in future shared channel 
                  wireless networks. }, 
  annote =	 {Proportional Fair Contention Resolution 
                  (PFCR). Achieve proportional fairness by controlling 
                  link access probability. On sucess, p is increased 
                  by an additive factor \alpha; on failure, decreased 
                  by a multiplicative factor (1-\beta).. }, 
  url =		 {} 
} 
@Misc{NLANR, 
  key =		 {NLANR}, 
  author =	 {{NLANR} Measurement and Operation Analysis Team}, 
  howpublished = {\url{http://moat.nlanr.net/}} 
} 
@InProceedings{NLJB+98, 
  author =	 {Nonnenmacher, J. and Lacher, M. and Jung, M. and 
                  Biersack, E.W. and Carle, G.}, 
  title =	 {How bad is reliable multicast without local 
                  recovery?}, 
  crossref =	 "infocom98", 
  abstract =	 {Compared C (source retransmission, FEC), D2 (RMTP-II 
                  like, with FEC), and D1 (RMTP-II without 
                  retransmission). In terms of bandwidth, D2 better 
                  than C, in terms of latency, D2 has shorter error 
                  recovery time} 
} 
@InProceedings{NN01, 
  author =	 {D. Niculescu and B. Nath.}, 
  title =	 {Ad-hoc positioning system.}, 
  booktitle =	 {Proceedings of IEEE Globecom 2001}, 
  year =	 2001, 
  month =	 Nov, 
  annote =	 {an accuracy of about one-third of the radio range 
                  for networks with dense populations of (highly 
                  connected) nodes. In a first phase anchors flood 
                  their location to all nodes in the network. Each 
                  unknown node records the position and (minimum) 
                  number of hops to at least three anchors. Whenever 
                  an anchor a1 infers the position of another anchor 
                  a2 it computes the distance between them, divides 
                  that by the number of hops, and floods this average 
                  hop distance into the network. Each unknown uses the 
                  average hop distance to convert hop counts to 
                  distances, and then performs a triangulation to 
                  three or more distant anchors to estimate its own 
                  position. DV-hop works well in dense and regular 
                  topologies, but for sparse or irregular networks the 
                  accuracy degrades to the radio range. mention mobile 
                  landmark (beacons} 
} 
@InProceedings{NN03:APS, 
  author =	 {Dragos Niculescu and Badri Nath}, 
  title =	 {Ad Hoc Positioning System ({APS}) Using {AOA}}, 
  crossref =	 {infocom03}, 
  year =	 2003, 
  url =		 {} 
} 
@Article{NN03:DV, 
  author =	 {Nath Niculescu}, 
  title =	 {{DV}-Based Positioning in Ad-Hoc Networks}, 
  journal =	 {Journal of Telecommunication Systems}, 
  year =	 {2003}, 
  annote =	 {Distance Vector coarse grained localization}, 
  url = 
                  {\url{http://paul.rutgers.edu/~dnicules/research/aps/aps-jrn.pdf}} 
} 
@InProceedings{NN03:TBF, 
  author =	 {Dragos Niculescu and Badri Nath}, 
  title =	 {Trajectory-Based Forwarding and its Applications}, 
  crossref =	 {mobicom03}, 
  year =	 {2003}, 
  url = 
                  {} 
} 
@inproceedings{NR00, 
  author =	 {N. Nisan and A. Ronen}, 
  title =	 {Computationally feasible {VCG} mechanisms}, 
  crossref =	 {ec00}, 
  year =	 2000, 
  pages =	 {242--252} 
} 
@Article{NR01, 
  author =	 {N. Nisan and A. Ronen}, 
  title =	 {Algorithmic Mechanism Design}, 
  journal =	 {Games and Economic Behavior}, 
  year =	 2001, 
  volume =	 35, 
  pages =	 {166--196}, 
  url =		 {\url{http://www.cs.huji.ac.il/\verb$~$noam/selfishJ.ps}} 
} 
@Article{Nag84, 
  author =	 {John Nagle}, 
  title =	 {Congestion Control in {IP/TCP} internetworks}, 
  journal =	 ccr, 
  year =	 {1984}, 
  volume =	 {14}, 
  number =	 {4}, 
  pages =	 {11--17}, 
  month =	 oct, 
  abstract =	 {} 
} 
@InProceedings{Nay01, 
  author =	 {K. Nayak}, 
  title =	 {Measuring Provider Path Diversity From Traceroute 
                  Data}, 
  booktitle =	 {Proceedings of {ISMA} Winter Workshop}, 
  year =	 2001, 
  address =	 {San Diego, CA}, 
  month =	 Dec, 
  url = 
                  {\url{http://www.caida.org/outreach/isma/0112/talks/krishna/index.pdf}} 
} 
@manual{Nimrod, 
  author =	 {Isidro Castineyra and Noel Chiappa and Martha 
                  Steenstrup}, 
  title =	 {The {N}imrod Routing Architecture, {RFC} 1992}, 
  year =	 1996, 
  month =	 Aug, 
  abstract =	 {Using CBT router to distribute keys}, 
} 
@inproceedings{Nis99, 
  author =	 "Noam Nisan", 
  title =	 "Algorithms for Selfish Agents", 
  booktitle =	 "16th Annual Symposium on Theoretical Aspects of 
                  Computer Science", 
  year =	 1999, 
  pages =	 "1--15" 
} 
@Unpublished{O97, 
  author =	 {Obraczka, K.}, 
  title =	 {Multicast transport mechanism: A survey and 
                  taxonomy}, 
  note =	 {submitted to IEEE Communications Magazine}, 
  year =	 {1997}, 
  abstract =	 {RM survey} 
} 
@Misc{OKM97, 
  author =	 {T. Ott and J. Kemperman and M. Mathis}, 
  title =	 {The Stationary Behavior of Ideal {TCP} Congestion 
                  Avoidance}, 
  howpublished = {\url{http://ftp.bellcore.com/pub/tjo/TCPwindow.ps}}, 
  year =	 1997, 
  url =		 {\url{http://ftp.bellcore.com/pub/tjo/TCPwindow.ps}}, 
  abstract =	 {TCP Modeling} 
} 
@InProceedings{OLW99, 
  author =	 {Teunis J. Ott and T. V. Lakshman and Larry Wong}, 
  title =	 {SRED: Stablized RED}, 
  crossref =	 "infocom99", 
  abstract =	 {Estimate the number of connections, which is a 
                  factor to decide the discarding probability in RED} 
} 
@InProceedings{ONKO+98, 
  author =	 {T. Ozugur and M. Naghshineh and P. Kermani and 
                  C. M. Olsen and B. Rezvani and J. A. Copeland}, 
  title =	 {Balanced media access methods for wireless networks}, 
  crossref =	 {mobicom98}, 
  abstract =	 {Variations of p-persistent protocol. p\_{ij} access 
                  probability for node i to send to node j. p_ij = 
                  degree of node j / maximum degree of all neighbors 
                  of node i. For highest degree node k, pik=min(1, 
                  degree_of_i/degree_of_k}, 
  url =		 {} 
} 
@Misc{OPENSSL, 
  key =		 {OpenSSL}, 
  title =	 {Open{SSL}}, 
  howpublished = {Available at \url{http://www.openssl.org/}}, 
} 
@article{OR89, 
  author =	 "Ariel Orda and Raphael Rom", 
  title =	 "Multihoming in Computer Networks: A Topology-Design 
                  Approach", 
  journal =	 "Computer Networks and {ISDN} Systems", 
  volume =	 18, 
  number =	 2, 
  pages =	 "133--141", 
  year =	 1989, 
  note =	 {multihoming}, 
  url =		 {}, 
  abstract =	 {Multihoming in networks, i.e., attaching a 
                  subscriber to more than a single access point in the 
                  network, is a mechanism used to increase several 
                  performance criteria. In this paper we take the 
                  topological design view and address the problem of 
                  finding optimal multihoming configurations for 
                  several topological design criteria. We analyze the 
                  problem and demonstrate that except for dual homing, 
                  multihoming is algorithmically complex. Optimal 
                  algorithms based on maximum matching in graphs and 
                  0-1 integer programming are given for all cases.} 
} 
@Book{OR94, 
  author =	 {Martin J. Osborne and Ariel Rubenstein}, 
  title =	 {A Course in Game Theory}, 
  publisher =	 {The {MIT} Press}, 
  year =	 1994 
} 
@Misc{OR99, 
  title =	 {{TCP} Emulation at the Receivers ({TEAR}), 
                  Presentation at the RM Meeting}, 
  author =	 {V. Ozdemir and I. Rhee}, 
  year =	 1999, 
  month =	 nov, 
  abstract =	 {TEAR} 
} 
@Article{ORS93, 
  author =	 {A. Orda and N. Rom and N. Shimkin }, 
  title =	 {Competitive Routing in Multi-User Communication 
                  Networks }, 
  journal =	 ton, 
  year =	 1993, 
  volume =	 1, 
  pages =	 {614--627}, 
} 
@Misc{OSPF, 
  key =		 "OSPF", 
  title =	 {Open Shortest Path First ({OSPF})}, 
  howpublished = {\url{http://www.ietf.org/html.charters/ospf-charter.html}} 
} 
@InProceedings{OTERS98, 
  author =	 {Li, D. and Cheriton, D.}, 
  title =	 {OTERS (On-Tree Efficient Recovery using Subcasting): 
                  A Reliable Multicast Protocol}, 
  crossref =	 "icnp98", 
  abstract =	 {Use IGMP to find tree structure} 
} 
@Misc{Ora00, 
  author =	 {A. Oram}, 
  title =	 {Gnutella and Freenet Represent True Technical 
                  Inovation}, 
  howpublished = {The O'Reilly Network (on-line)}, 
  month =	 Dec, 
  year =	 2000, 
  url = 
                  {\url{http://www.oreillynet.com/pub/a/network/2000/05/12/magazine/gnutella.html}} 
} 
@Article{P+98, 
  author =	 {Craig Partrige et. al.}, 
  title =	 {A 50-{G}b/s {IP} router}, 
  journal =	 ton, 
  year =	 1998, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p237-partridge/}}, 
  volume =	 6, 
  number =	 3, 
  pages =	 {237--248}, 
  month =	 Jun 
} 
@Misc{P1363, 
  title =	 {{IEEE} {P}1363 Standard}, 
  author =	 {{IEEE} {P}1363 Group}, 
  howpublished = {Available at 
                  \url{http://grouper.ieee.org/groups/1363/index.html}}, 
} 
@Misc{P3P10, 
  author =	 {L. Cranor and M. Langheinrich and M. Marchiori and 
                  M. Presler-Marshall and J. Reagle}, 
  title =	 {The Platform for Privacy Preferences 1.0 ({P3P}1.0) 
                  Specification}, 
  howpublished = {\url{http://www.w3.org/TR/P3P/}}, 
  annote =	 {location} 
} 
@InProceedings{P97a, 
  author =	 {Vern Paxson}, 
  title =	 {Automated Packet Trace Analysis of {TCP} 
                  Implementations}, 
  crossref =	 "sigcomm97", 
  abstract =	 {first one} 
} 
@InProceedings{P97b, 
  author =	 {Vern Paxson}, 
  title =	 {End-to-End {I}nternet Packet Dynamics}, 
  crossref =	 "sigcomm97", 
  abstract =	 {ANother one}, 
  url = 
                  {\url{http://www.acm.org/sigcomm/sigcomm97/papers/p086.html}} 
} 
@InProceedings{PB94, 
  author =	 {C. E. Perkins and P. Bhagwat}, 
  title =	 {Highly dynamic destination-sequenced distance-vector 
                  routing for mobile computers}, 
  crossref =	 {sigcomm94}, 
  abstract =	 {DSDV}, 
  url =		 {} 
} 
@InProceedings{PC97, 
  author =	 {V. D. Park and M. S. Corson}, 
  title =	 {A highly adaptive distributed routing algorithm for 
                  mobile wireless networks,}, 
  crossref =	 {infocom97}, 
  pages =	 {1405--1413}, 
  annote =	 {AODV}, 
  url =		 {} 
} 
@inproceedings{PCB00, 
  author =	 "Nissanka B. Priyantha and Anit Chakraborty and Hari 
                  Balakrishnan", 
  title =	 "The {C}ricket location-support system", 
  crossref =	 "mobicom00", 
  pages =	 "32--43", 
  year =	 2000, 
  abstract =	 {This paper presents the design, implementation, and 
                  evaluation of Cricket, a location-support system for 
                  in-building, mobile, location dependent 
                  applications. It allows applications running on 
                  mobile and static nodes to learn their physical 
                  location by using listeners that hear and analyze 
                  information from beacons spread throughout the 
                  building. Cricket is the result of several design 
                  goals, including user privacy, decentralized 
                  administration, network heterogeneity, and low 
                  cost. Rather than explicitly tracking user location, 
                  Cricket helps devices learn where they are and lets 
                  them decide whom to advertise this information to; 
                  it does not rely on any centralized management or 
                  control and there is no explicit coordination 
                  between beacons; it provides information to devices 
                  regardless of their type of network connectivity; 
                  and each Cricket device is made from off-the-shelf 
                  components and costs less than U.S. \$10. We 
                  describe the randomized algorithm used by beacons to 
                  transmit information, the use of concurrent radio 
                  and ultrasonic signals to infer distance, the 
                  listener inference algorithms to overcome multipath 
                  and interference, and practical beacon configuration 
                  and positioning techniques that improve 
                  accuracy. Our experience with Cricket shows that 
                  several location-dependent applications such as 
                  in-building active maps and device control can be 
                  developed with little effort or manual 
                  configuration.}, 
  url =		 {}, 
  key =		 {location} 
} 
@InProceedings{PCB00:1, 
  author =	 {Nissanka Priyantha and Anit Chakraborty and Hari 
                  Balakrishnan }, 
  title =	 {The Cricket Location-Support System}, 
  crossref =	 "mobicom00", 
  abstract =	 {This paper presents the design, implementation, and 
                  evaluation of Cricket, a location-support system for 
                  in-building, mobile, location-dependent 
                  applications. It allows applications running on 
                  mobile and static nodes to learn their physical 
                  location by using listeners that hear and analyze 
                  information from beacons spread throughout the 
                  building. Cricket is the result of several design 
                  goals, including user privacy, decentralized 
                  administration, network heterogeneity, and low 
                  cost. Rather than explicitly tracking user location, 
                  Cricket helps devices learn where they are and lets 
                  them decide whom to advertise this information to; 
                  it does not rely on any centralized management or 
                  control and there is no explicit coordination 
                  between beacons; it provides information to devices 
                  regardless of their type of network connectivity; 
                  and each Cricket device is made from off-the-shelf 
                  components and costs less than US\$10. We describe 
                  the randomized algorithm used by beacons to transmit 
                  information, the use of concurrent radio and 
                  ultrasonic signals to infer distance, the listener 
                  inference algorithms to overcome multipath and 
                  interference, and practical beacon configuration and 
                  positioning techniques that improve usability. Our 
                  experience with Cricket shows that several 
                  location-dependent applications such as in-building 
                  active maps and device control can be developed with 
                  little effort or manual configuration. } 
} 
@InProceedings{PCD03, 
  author =	 {Konstantina Papagiannakix and Rene Cruzz and 
                  Christophe Diot}, 
  title =	 {Network Performance Monitoring at Small Time Scales}, 
  crossref =	 {imc03}, 
  year =	 2003, 
  url =		 {\url{http://www.icir.org/vern/imc-2003/papers/paper1.pdf}}, 
  abstract =	 {SNMP statistics are usually collected over intervals 
                  of 5 min- utes and correspond to average activity of 
                  IP links and net- work elements for the duration of 
                  the interval. Nevertheless, reports of trac 
                  performance across periods of minutes can mask out 
                  performance degradation due to short-lived events, 
                  such as micro-congestion episodes, that manifest 
                  themselves at smaller time scales. In this paper we 
                  perform a mea- surement study of packet traces 
                  collected inside the Sprint IP network to identify 
                  the time scales over which micro- congestion 
                  episodes occur. We characterize these episodes with 
                  respect to their amplitude, frequency and 
                  duration. We dene a new performance metric that 
                  could be easily com- puted by a router and reported 
                  every 5 minutes through SNMP to shed light into the 
                  micro-behavior of the car- ried trac. We show that 
                  the proposed performance metric is well suited to 
                  track the time scales over which micro- congestion 
                  episodes occur, and may be useful for a variety of 
                  network provisioning tasks.} 
} 
@Book{PD99, 
  author =	 {Larry L. Peterson and Bruce S. Davie}, 
  title =	 {Computer Networks: A Systems Approach}, 
  publisher =	 {Morgan Kaufmann Publishers}, 
  year =	 1999, 
  edition =	 {2nd}, 
  month =	 oct 
} 
@Article{PF95, 
  author =	 {V. Paxson and S. Floyd}, 
  title =	 {Wide-Area Traffic: The Failure of {Poisson} 
                  Modeling}, 
  journal =	 ton, 
  year =	 {1995}, 
  volume =	 {3}, 
  number =	 {3}, 
  pages =	 {226--244}, 
  month =	 jun, 
  abstract =	 {Shows self similarity of Internet traffic. Long 
                  tail} 
} 
@InProceedings{PF97, 
  author =	 {Vern Paxson and Sally Floyd}, 
  title =	 {Why We Don't Know How to Simulate the {Internet}}, 
  booktitle =	 {Proceedings of the 1997 Winter Simulation 
                  Conference}, 
  year =	 1997 
} 
@Article{PFTK00, 
  author =	 {Jitendra Padhye and Victor Firoiu and Donald 
                  F. Towsley and James F. Kurose}, 
  title =	 {Modeling {TCP} {R}eno performance: a simple model 
                  and its empirical validation}, 
  journal =	 ton, 
  year =	 2000, 
  volume =	 8, 
  number =	 2, 
  month =	 Apr 
} 
@InProceedings{PFTK98, 
  author =	 {J. Padhye and V. Firoiu and D. Towsley and 
                  J. Kurose}, 
  title =	 {Modeling {TCP} throughput: a simple model and its 
                  empirical validation}, 
  crossref =	 "sigcomm98", 
  abstract =	 {TCP modeling} 
} 
@InProceedings{PGH98, 
  author =	 {G. Pei and M. Gerla and X. Hong}, 
  title =	 {LANMAR: Landmark routing for large scale wireless ad 
                  hoc networks with group mobility}, 
  crossref =	 {mobihoc00}, 
  year =	 2000, 
  url =		 {} 
} 
@article{PGM98, 
  author =	 {Speakman, Tony and Farinacci, Dino and Lin, Steve 
                  and Tweedly, Alex}, 
  title =	 {PGM Reliable Transport Protocol Specification}, 
  journal =	 {INTERNET-DFAFT}, 
  year =	 {1998}, 
  month =	 Aug, 
  abstract =	 {PGM provides ordered, duplicate-free, multicast data 
                  from multiple senders to multiple receivers.PGM has 
                  no notion of group membership. It simply provides 
                  reliable multicast data delivery within a transmit 
                  window advanced by a source in the absence of 
                  negative acknowledgments from any receiver. Reliable 
                  delivery is provided within a source's transmit 
                  window from the time a receiver joins the group 
                  until it departs. PGM guarantees that a receiver in 
                  the group either receives all data packets from 
                  transmissions and retransmissions, or is able to 
                  detect unrecoverable data packet loss. PGM is best 
                  suited to those applications in which members may 
                  join and leave at any time, and that are either 
                  insensitive to unrecoverable data packet loss or are 
                  prepared to resort to application recovery in the 
                  event. Through its optional extensions, PGM provides 
                  specific mechanisms to support applications as 
                  disparate as stock and news updates, data 
                  conferencing, and low-delay, real-time video 
                  transfer. Summary of Operations: PGM runs over a 
                  datagram multicast protocol such as IP multicast 
                  [5]. In the normal course of data transfer, a source 
                  multicasts sequenced data packets (ODATA), and 
                  receivers unicast selective negative acknowledgments 
                  (NAKs) for data packets detected to be missing from 
                  the expected sequence. Network elements forward NAKs 
                  PGM-hop-by-PGM-hop to the source, and confirm each 
                  hop by multicasting a NAK confirmation (NCF) in 
                  response on the interface on which the NAK was 
                  received. Retransmissions (RDATA) may be provided 
                  either by the source itself or by a Designated Local 
                  Retransmitter (DLR) in response to a NAK, or by 
                  another receiver in response to an NCF. \em{The 
                  security considerations of PGM are}: In addition to 
                  the usual problems of end-to-end authentication, PGM 
                  is vulnerable to a number of security risks that are 
                  specific to the mechanisms it uses to establish 
                  source path state, to establish retransmit state, to 
                  forward NAKs, to identify DLRs, and to distribute 
                  retransmissions. These mechanisms expose PGM network 
                  elements themselves to security risks since network 
                  elements not only switch but also interpret SPMs, 
                  NAKs, NCFs, and RDATA, all of which may legitimately 
                  be transmitted by PGM sources, receivers, and 
                  DLRs. Short of full authen- tication of all 
                  neighboring sources, receivers, DLRs, and network 
                  ele- ments, the protocol is not impervious to 
                  abuse. So putting aside the problems of rogue PGM 
                  network elements for the moment, there are enough 
                  potential security risks to network elements 
                  associated with sources, receivers, and DLRs 
                  alone. These risks include denial of service through 
                  the exhausting of both CPU bandwidth and memory, as 
                  well as loss of (retransmit) data connectivity 
                  through the muddling of retransmit state. False SPMs 
                  may cause PGM network elements to mis-direct NAKs 
                  intended for the legitimate source with the result 
                  that the requested RDATA would not be 
                  forthcoming. False NAKs may cause PGM network 
                  elements to establish spurious retransmit state that 
                  will expire only upon time-out and could lead to 
                  memory exhaustion in the meantime. False NCFs may 
                  cause PGM network elements to suspend NAK forwarding 
                  prematurely (or to mis-direct NAKs in the case of 
                  redirecting NCFs) resulting eventually in loss of 
                  RDATA. False RDATA may cause PGM network elements to 
                  tear down legitimate retransmit state resulting 
                  eventually in loss of legitimate RDATA. The 
                  development of precautions for network elements to 
                  protect them- selves against incidental or 
                  unsophisticated versions of these attacks is work in 
                  progress and includes: Damping of jitter in the 
                  value of either the source NLA of SPMs or the path 
                  NLA in SPMs. While the source NLA is expected to 
                  change seldom, the path NLA is expected to change 
                  occasionally as a conse- quence of changes in 
                  underlying multicast routing information. The 
                  extension of NAK shedding procedures to control the 
                  volume, not just the rate, of confirmed NAKs. In 
                  either case, these procedures assist network 
                  elements in surviving NAK attacks at the expense of 
                  maintaining service. More efficiently, network 
                  elements may use the knowledge of TSIs and their 
                  associated transmit windows gleaned from SPMs to 
                  control the proliferation of retransmit 
                  state. Matching of the source NLA of NCFs against 
                  the path NLA in SPMs (or the DLR's NLA in OPT_REDIR) 
                  to verify that the confirmation is at least 
                  apparently coming from the expected entity. A 
                  three-way handshake between network elements and 
                  DLRs that would permit a network element to 
                  ascertain with greater confidence that an alleged 
                  DLR is in fact on the same subnet, is identified by 
                  the alleged NLA, and is PGM conversant. Since PGM's 
                  Local Retransmission procedures allow any receiver 
                  to provide RDATA, the source NLA of RDATA may vary 
                  widely in value. At the expense of the efficiencies 
                  of local retransmission, a PGM net- work element 
                  could reduce its vulnerability to false RDATA by 
                  accept- ing RDATA only from the source, but as with 
                  all of these procedures, this is still no protection 
                  against full falsification of the network-layer 
                  header. }, 
  annote =	 {Below is my idea on how to make it secure: (1) PMG 
                  also provides ordered, duplicate-free, the 
                  functionality is overlap with IPSec, can we get rid 
                  of one.} 
} 
@InProceedings{PH02, 
  author =	 {P.Papadimitratos and Z.J. Haas}, 
  title =	 {Secure Routing for Mobile Ad Hoc Networks}, 
  booktitle =	 {SCS Communication Networks and Distributed Systems 
                  Modeling and Simulation Conference (CNDS 2002)}, 
  year =	 2002, 
  address =	 {San Antonio, TX}, 
  month =	 Jan 
} 
@Article{PHH98, 
  author =	 {C. Perkins and O. Hodson and V. Hardman}, 
  title =	 {A survey of packet-loss recovery techniques for 
                  streaming audio}, 
  journal =	 {IEEE Network Magazine}, 
  year =	 1998, 
  month =	 sep, 
  url =		 {\url{http://www.fokus.gmd.de/step/carle/survey/}} 
} 
@Misc{PHS00, 
  title =	 {{BGRP}: A framework for scalable resource 
                  reservation}, 
  author =	 {P. Pan and E. Hahne and H. Schulzrinne}, 
  year =	 2000, 
  howpublished = {IETF Internet-Draft, 
                  draft-pan-bgrp-framework-00.txt}, 
  abstract =	 {Intserv} 
} 
@manual{PIM99, 
  author =	 {PIM Working Group}, 
  title =	 {Authenticating {PIM} version 2 messages, 
                  INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 Mar, 
  abstract =	 {This ID discuss to authenticate messages between 
                  PIMv2 routers. There are 3 types of routers in a 
                  PIMv2 domain: BootStrap Router (bsr), Rendezvous 
                  Point Router (rp), and Designated Router (dr). The 
                  author propose to use IPSec for authentication 
                  between routers. The three main cases where a PIM 
                  router interacts with other routers on different 
                  subnets are: (1)The bootstrap router sends 
                  authoritative group-to-RP mappings to all other 
                  routers in the same PIM domain. If PIM routers 
                  accept bootstrap messages from non-authorized 
                  candidate BSRs, it can potentially disrupt multicast 
                  routing for the entire PIM domain. (2)Candidate RPs 
                  sending candidate RP advertisement messages to the 
                  BSR. The BSR needs to avoid advertising bogus 
                  group-to-RP mappings, which can lead to 
                  unpredictable routing state. (3)DRs sending Register 
                  messages to the RPs. The RPs need to ignore register 
                  messages from unauthorized PIM sources. After 
                  identifying these attacks, the authors proposed 2 
                  authentication methods: (1) Equal Opportunity 
                  method. All routers within the domain use the same 
                  key for all PIM messages. (2) Differentiated 
                  Capabilities Method. In this case, all routers 
                  still share one common key. However, special efforts 
                  are made to protect the first 2 attacks. (1) All BSR 
                  routers share a common RSA key pairs. The public key 
                  is distributed to all routers in the 
                  domain. Bootstrap messages are signed using the 
                  private key.(2)All RPs and BSRs share another 
                  symmetric key. No other routers have this key. This 
                  key is called the RP key. For candidate RP 
                  advertisement the digest is only calculated with the 
                  RP key, instead of the equal opportunity key. The 
                  above approaches makes it easier to support very 
                  large PIM domains where some PIM routers may be 
                  managed by multiple operators. MY OPINION: There are 
                  some problems with SPI. In this ID, the requirements 
                  are: (1)When the differentiated capability method is 
                  in use, separate SPIs are needed for the different 
                  security associations. (2)Initialized to zero, 
                  incremented by one on each subsequent PIM message 
                  from the same originator. This means each receiver 
                  will have to keep the SAD for destination address, 
                  the IPSec replay attack mechanism may not work. It 
                  is obvious bsr/rp is a subgroup of all PIM routers 
                  will higher privilege. Therefore, it can be make 
                  $K_all = H(K_bsr/rp)$, this can save the rp/bsr some 
                  works} 
} 
@InProceedings{PK00, 
  author =	 {Andreas Pfitzmann and Marit K\"ohntopp}, 
  title =	 {Anonymity, Unobservability, and Pseudonymity: A 
                  Proposal for Terminology}, 
  booktitle =	 {Proceedings of the International Workshop on Design 
                  Issues in Anonymity and Unobservability}, 
  pages =	 {1--9}, 
  year =	 2000, 
  volume =	 2009, 
  series =	 {Lecture Notes in Computer Science}, 
  month =	 Jul, 
  url = 
                  {http://freehaven.net/anonbib/papers/Anon_Terminology_v0.14.pdf}, 
  annote =	 {location; propose linkability concept} 
} 
@InProceedings{PKC96, 
  author =	 {K. Park and G. Kim and M. Crovella}, 
  title =	 {On the Relationship Between File Sizes, Transport 
                  Protocols and Self-similar Network Traffic}, 
  crossref =	 "icnp96", 
  abstract =	 {Self similar} 
} 
@InProceedings{PKTK99, 
  author =	 {Jitendra Padhye and Jim Kurose and Don Towsley and 
                  Rajeev Koodli}, 
  title =	 {A Model Based {TCP}-Friendly Rate Control Protocol}, 
  crossref =	 "nossdav99", 
  abstract =	 {first version} 
} 
@InProceedings{PLM01, 
  author =	 {Philippe Golle and Kevin Leyton-Brown and Ilya 
                  Mironov}, 
  title =	 {Incentives in Peer-to-Peer File Sharing}, 
  crossref =	 {ec01}, 
  year =	 2001, 
  url =		 {} 
} 
@Article{PLRB01, 
  author =	 {R. Puri and Kang-Won Lee and K. Ramchandran and 
                  V. Bharghavan}, 
  title =	 {An integrated source transcoding and congestion 
                  control paradigm for video streaming in the 
                  {I}nternet}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909591.pdf?isNumber=19626}} 
} 
@InProceedings{PLS01, 
  author =	 {Johan Pouwelse and Koen Langendoen and Henk Sips}, 
  title =	 {Dynamic Voltage Scaling on a Low-Power 
                  Microprocessor}, 
  crossref =	 "mobicom01", 
  abstract =	 {Power consumption is the limiting factor for the 
                  functionality of future wearable devices. Since 
                  interactive applications like wireless information 
                  access generate bursts of activities, it is 
                  important to match the performance of the wearable 
                  device accordingly. This paper describes a system 
                  with a microprocessor whose speed can be varied 
                  (frequency scaling) as well as its input 
                  voltage. Voltage scaling is important for reducing 
                  power consumption to very low values when operating 
                  at low speeds. Measurements show that the energy per 
                  instruction at minimal speed (59 MHz) is 1/5 of the 
                  energy required at full speed (251 MHz). The 
                  frequency and voltage can be scaled dynamically from 
                  user space in only 140 mu s. This allows power-aware 
                  applications to quickly adjust the performance level 
                  of the processor whenever the workload 
                  changes. Experiments with an H.263 video benchmark 
                  show that the power-aware decoder outperforms a 
                  static fixed-frequency policy as well as a dynamic 
                  interval-based scheduler.} 
} 
@Article{PM95, 
  author =	 {V. Padmanabhan and J. Mogul}, 
  title =	 {Improving HTTP Latency}, 
  journal =	 {Computer Networks and {ISDN} Systems}, 
  year =	 1995, 
  volume =	 8, 
  pages =	 {25--35}, 
  month =	 Dec, 
  url =		 {} 
} 
@InProceedings{WMRW05, 
  author =	 {Jian Wu and Zhuoqing Morley Mao and Jennifer Rexford 
                  and Jia Wang}, 
  title =	 {Finding a Needle in a Haystack: Pinpointing 
                  Significant {BGP} Routing Changes in an {IP} 
                  Network}, 
  crossref =	 {nsdi05} 
} 
@InProceedings{PMBT01, 
  author =	 {Nissanka Priyantha and Allen Miu and Hari 
                  Balakrishnan and Seth Teller}, 
  title =	 {A Software Compass for Context-Aware Applications}, 
  crossref =	 "mobicom01", 
  abstract =	 {The ability to determine the orientation of a device 
                  is of fundamental importance in context-aware and 
                  location-dependent mobile computing. By analogy to 
                  an ordinary compass, knowledge of orientation 
                  through a ``software compass'' attached to a mobile 
                  device enhances various applications, including 
                  efficient way-finding and navigation, directional 
                  service discovery, and ``augmented-reality'' 
                  displays. Using fixed active beacons and passive 
                  position sensors, we show how to estimate the 
                  orientation of a mobile device to within a few 
                  degrees, using differences in distance estimates 
                  from a beacon to each sensor on the compass. There 
                  are two essential pieces to this capability. First, 
                  we show how to arrange three or more receivers 
                  precisely, a few centimeters apart on the compass, 
                  so that the differential arrival time of an 
                  ultrasonic carrier can be precisely estimated for 
                  any pair of receivers to within the required 
                  sub-centimeter accuracy. Second, given a set of 
                  fixed, active position beacons whose locations are 
                  known, we describe an algorithm that combines 
                  several carrier arrival times to produce a robust 
                  estimate of the rigid orientation of the mobile 
                  compass. Our physical sensor configuration involves 
                  five passive ultrasonic receivers, each 0.8cm in 
                  diameter, arrayed in a ``V'' shape several 
                  centimeters across. Using multiple beacons 
                  distributed throughout a building, each broadcasting 
                  coupled 418MHz RF packet data and a 40KHz ultrasound 
                  carrier, we demonstrate that our techniques 
                  determine compass orientation to within 3 degrees 
                  when the true angle lies between plus or minus 30 
                  degrees, and to within 5 degrees when the true angle 
                  lies between plus or minus 40 degrees, with respect 
                  to a fixed beacon.} 
} 
@InProceedings{PPP00, 
  author =	 {Rong Pan and Balaji Prabhakar and Konstantinos 
                  Psounis}, 
  title =	 {{CHOK}e, A Stateless Active Queue Management Scheme 
                  for Approximating Fair Bandwidth Allocation}, 
  crossref =	 "infocom00", 
  abstract =	 {CHOKe} 
} 
@InProceedings{PR99, 
  author =	 {C. E. Perkins and E. M. Royer}, 
  title =	 {Ad-hoc on demand distance vector routing}, 
  booktitle =	 {IEEE Workshop on Mobile Computing Systems and 
                  Applications ({WMCSA})}, 
  year =	 1999, 
  month =	 Feb, 
  url =		 {} 
} 
@InProceedings{PSK94, 
  author =	 {Paul, S. and Sabnani, K. and Kristol, D.}, 
  title =	 {Multicast Transport Protocols for High Speed 
                  Networks}, 
  crossref =	 "icnp94", 
  abstract =	 {propose RMTP} 
} 
@Article{PSLB97, 
  author =	 {Paul, S. and Sabnani, K. and Lin, J. and 
                  Bhattacharyya, S.}, 
  title =	 {Reliable Multicast Transport Protocol (RMTP)}, 
  journal =	 jsac, 
  year =	 {1997}, 
  volume =	 {15}, 
  number =	 {3}, 
  abstract =	 {RMTP} 
} 
@Article{PT00, 
  author =	 {K. Park and T. Tuan}, 
  title =	 {Performance evaluation of multiple time scale {TCP} 
                  under self-similar traffic conditions}, 
  journal =	 {ACM Transactions on Modeling and Computer 
                  Simulation}, 
  year =	 2000, 
  volume =	 24, 
  pages =	 {154--177}, 
  url =		 {\url{http://www.cs.purdue.edu/nsl/tomacs-00.pdf}} 
} 
@InCollection{PW00, 
  author =	 {K. Park and W. Willinger}, 
  booktitle =	 {Self-Similar Network Traffic and Performance 
                  Evaluation}, 
  title =	 {Self-similar network traffic: An overview}, 
  publisher =	 {Wiley-Interscience}, 
  year =	 2000, 
  url = 
                  {\url{http://www.cs.purdue.edu/nsl/intro-ss-chap.ps.gz}} 
} 
@InProceedings{Pad83, 
  author =	 {M.A. Padlipsky}, 
  title =	 {A Perspective on the ARPANET Reference Model}, 
  crossref =	 "infocom83" 
} 
@InProceedings{Pap01, 
  author =	 {C. Papadimitriou}, 
  title =	 {Algorithms, Games, and the {I}nternet}, 
  crossref =	 {stoc01}, 
  pages =	 {749--753}, 
  year =	 2001, 
  url =		 {} 
} 
@MastersThesis{Par00, 
  author =	 {Mital Parikh}, 
  title =	 {Traffic Metrics for Adaptive Routing}, 
  school =	 {University of Massachusetts Lowell}, 
  year =	 2000, 
  month =	 Aug, 
  annote =	 {adaptive routing}, 
  url =		 {\url{http://morse.uml.edu/research.d/traffic/k1.pdf}} 
} 
@InCollection{Pat02, 
  author =	 {Michael Patriksson}, 
  title =	 {Algorithms for Computing Traffic Equilibria}, 
  booktitle =	 {Networks and Spacial Economics}, 
  year =	 2003, 
  url = 
                  {\url{http://www.cs.chalmers.se/\verb$~$mipat/LATEX/NSE.ps}} 
} 
@InProceedings{Pax96, 
  author =	 {V. Paxson}, 
  title =	 {End-to-End Routing Behavior in the {I}nternet}, 
  crossref =	 "sigcomm96", 
  year =	 1996, 
  url =		 {ftp://ftp.ee.lbl.gov/papers/routing.SIGCOMM.ps.Z} 
} 
@Article{Pen99, 
  author =	 {Mathew D. Penrose}, 
  title =	 {On k-connectivity for a geometric random graph}, 
  journal =	 {Random Structures and Algorithms}, 
  year =	 1999, 
  volume =	 15, 
  number =	 2, 
  pages =	 {145--164}, 
  abstract =	 {For n points uniformly randomly distributed on the 
                  unit cube in d dimensions, with d>=2, let \rau_n 
                  (respectively, \delta_n) denote the minimum r at 
                  which the graph, obtained by adding an edge between 
                  each pair of points distant at most r apart, is 
                  k-connected (respectively, has minimum degree 
                  k). Then P[\rau_n=\delta_n]1 as n goes to infinite.}, 
  annote =	 {author from Department of Mathematical Sciences, 
                  University of Durham, South Road, Durham, DH1 3LE, 
                  United Kingdom}, 
  url = 
                  { 
url{http://download.interscience.wiley.com/cgi-bin/fulltext?ID=63000605&PLACEBO=IE.pdf&mode=pdf}} 
} 
@Book{Per00, 
  author =	 {Charles Perkins}, 
  title =	 {Ad Hoc Networking}, 
  publisher =	 {Addison-Wesley}, 
  year =	 2000 
} 
@manual{Pos81a, 
  author =	 {J. Postel}, 
  title =	 {{I}nternet {P}rotocol, {RFC} 791}, 
  month =	 Sep, 
  year =	 1981 
} 
@manual{Pos81b, 
  author =	 {J. Postel}, 
  title =	 {{T}ransmission {C}ontrol {P}rotocol, {RFC} 793}, 
  month =	 Sep, 
  year =	 1981 
} 
@Book{Pro01, 
  author =	 {John G. Proakis}, 
  title =	 {Digital Communications}, 
  publisher =	 {McGraw Hill}, 
  year =	 2001, 
  edition =	 {Fourth} 
} 
@Misc{Proficient, 
  key =		 {Proficient}, 
  author =	 {{Proficient Networks, Inc.}}, 
  howpublished = {\url{http://www.proficientnetworks.com}} 
} 
@InProceedings{QW01, 
  author =	 {Chunming Qiao and Hongyi Wu}, 
  title =	 {{iCAR}: an Integrated Cellular and Ad-hoc Relay 
                  System}, 
  crossref =	 "icccn01", 
  abstract =	 {Ever increasing data traffic and limited capacity 
                  are major causes for congestion in current cellular 
                  systems. This paper presents a new architecture for 
                  the next generation wireless systems based on the 
                  integration of the cellular infrastructure and 
                  modern Ad-hoc relaying technologies. The new 
                  architecture can efficiently balance traffic loads 
                  between cells by using Ad-hoc relay stations (ARS) 
                  to relay traffic from one cell to another cell 
                  dynamically. This can not only increase a system's 
                  capacity cost-effectively, but also reduce 
                  transmis-sion power for mobile hosts, and provide 
                  services for shadow areas. In this paper, we present 
                  the architectural concept in-cluding its basic 
                  operations and principle benefits. We also propose a 
                  seed-growing approach for ARS placement, and discuss 
                  the upper bound on the number of seed ARS^Ys needed 
                  in the system. We evaluate the performance 
                  improvement of the new architecture through analysis 
                  and simulations.} 
} 
@InProceedings{QYZS03, 
  author =	 {Lili Qiu and Yang Richard Yang and Yin Zhang and 
                  Scott Shenker}, 
  title =	 {Selfish Routing in {I}nternet-like Environments}, 
  crossref =	 {sigcomm03}, 
  year =	 2003 
} 
@manual{Qui98, 
  author =	 {Quinn, Bob}, 
  title =	 {{IP} Multicast Applications: Challenges and 
                  Solutions, INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 dec, 
  abstract =	 {The focus of the ID is on Applications, but not on 
                  Infrastructure or Mechanisms. The primary 
                  requirements challenge are Heterogeneous receivers 
                  (can use feedback loops but may cause implosion, can 
                  use FEC, but use BW, can use shared learning, but 
                  has privacy problem, can use local recovery but has 
                  management problem), reliable delivery (can use NAK, 
                  but implosion still exist, can use FEC, shared 
                  learning or local recovery), and secure 
                  multicast.The ID divides multicast applications into 
                  3 categories: 1-m, m-m, m-1. \em{1-m} It's analogous 
                  to TV/Radio. It can be push media (headlines, 
                  weather, sports), or file distribution and caching, 
                  or announcements (network time, session schedule, 
                  randoms, keys) or monitoring applications (stock 
                  price, sensor, security, and manufacturing) \em{m-m} 
                  can be multimedia conferencing (A/V, white-board), 
                  synchronized resources (database update), concurrent 
                  processing (distr. and parallel), shared editing and 
                  collaboration, or interactive learning, or 
                  distributed interactive simulation, or multi-player 
                  gaming, or chat-groups, or jam sessions. \em{m-1} 
                  Many of this type applications are request and 
                  response type. examples include resource discovery 
                  of service location, anycast. It also can be data 
                  collection process, or auction process, or polling 
                  process, or juke box. Some performance requirements 
                  are BW, Delay, and Jitters.} 
} 
@InCollection{R94, 
  author =	 {L. Roberts}, 
  title =	 {Rate based algorithm for point to multipoint {ABR} 
                  service}, 
  booktitle =	 {ATM Forum Contribution 94-0772}, 
  publisher =	 {ATM Forum}, 
  year =	 1994 
} 
@Article{R97, 
  author =	 {Rizzo, L.}, 
  title =	 {Effective Erasure Codes for Reliable Computer 
                  Communication Protocols}, 
  journal =	 ccr, 
  year =	 {1997}, 
  month =	 Apr 
} 
@InProceedings{YKKV+02, 
  author =	 {T. Ye and H. Kaur and S. Kalyanaraman and K. Vastola 
                  and S. Yadav}, 
  title =	 {Optimization of {OSPF} weights using online 
                  simulation}, 
  booktitle =	 "Proceedings of International Workshop on Quality of 
                  Service ({IWQoS}))", 
  year =	 2002, 
  abstract =	 {TE} 
} 
@InProceedings{RBR99, 
  author =	 {I. Rhee and N. Ballaguru and G. N. Rouskas}, 
  title =	 {{MTCP}: Scalable {TCP}-like Congestion Control for 
                  Reliable Multicast}, 
  crossref =	 "infocom99", 
  abstract =	 {Propose MTCP} 
} 
@InProceedings{RCJ88, 
  author =	 {K. Ramakrishnan and D. Chiu and R. Jain}, 
  title =	 {Congestion Avoidance in Computer Networks with a 
                  Connectionless Network Layer}, 
  crossref =	 "sigcomm88", 
  abstract =	 {The link is a revised version.}, 
  url =		 {} 
} 
@InProceedings{RD00, 
  author =	 {Qun Ren and Margaret Dunham}, 
  title =	 {Using Semantic Caching to Manage Location Dependent 
                  Data in Mobile Computing}, 
  crossref =	 "mobicom00", 
  abstract =	 {Location-dependent applications are becoming more 
                  and more popular in mobile environments. To improve 
                  system performance and facilitate disconnection, 
                  caching is crucial to such applications. In this 
                  paper, a semantic caching scheme is used to access 
                  location dependent data in mobile computing. We 
                  first develop a mobility model to represent the 
                  moving behaviors of mobile users and formally define 
                  location dependent queries. We then investigate 
                  query processing and cache management 
                  strategies. The performance of the semantic caching 
                  scheme and its replace ment strategy FAR is 
                  evaluated through a simulation study. Our results 
                  show that semantic caching is more flexible and 
                  effective for use in LDD applications than page 
                  caching, whose performance is quite sensitive to the 
                  database physical organization. We also notice that 
                  the semantic cache replacement strategy FAR, which 
                  utilizes the semantic locality in terms of 
                  locations, performs robustly under different kinds 
                  of workloads. } 
} 
@manual{RF99, 
  title =	 {A Proposal to add Explicit Congestion Notification 
                  ({ECN}) to {IP}, {RFC} 2481}, 
  author =	 {K. K. Ramakrishnan and S. Floyd}, 
  year =	 {1999}, 
  month =	 Jan, 
  abstract =	 {ECN}, 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2481.html}} 
} 
@InProceedings{RFFG01, 
  author =	 {Michael Ritter and Robert Friday and William San 
                  Filippo and Rodrigo Garces}, 
  title =	 {Mobile Connectivity in the Ricochet MicroCellular 
                  Data Network {(MCDN)} System}, 
  crossref =	 "mobicom01", 
  abstract =	 {We describe the protocols implemented in the 
                  Ricochet MCDN system to provide continuous 
                  connectivity to mobile users travelling up to 70 
                  mph. The MCDN system is a mesh-based system of 
                  microcells that are connected wirelessly to an 
                  interspersed mesh of wired access points (WAPs) 
                  which cover approximately 12 square miles on 
                  average. The average microcell density is 
                  approximately 5-6 per square mile, with 4-8 
                  overlapping cells at each point. Since the system is 
                  entirely packet-based, there are no cell hand-off 
                  negotiations requried, however, when travelling 
                  through the mesh of microcells at a high rate of 
                  speed, the mobile unit must acquire new cells fast 
                  enough to ensure continuous connectivity. The system 
                  must also know how to route packets to the mobile 
                  unit as it drops old cells and acquires new 
                  ones. This paper discusses the acquisition, 
                  registration, and routing protocols that make this 
                  possible and reviews performance data of typical 
                  mobile users.} 
} 
@InProceedings{RGHS+00, 
  author =	 {Gopalakrishnan Raman and James Griffioen and Gisli 
                  Hjalmtysson and Cormac Sreenan and Su Wen}, 
  title =	 {Simple Loss Differentiation Approach to Layered 
                  Multicast}, 
  crossref =	 "infocom00", 
  abstract =	 {In this paper, the author propose to have a two 
                  level drop priority in the network. A receiver joins 
                  the layers within its capacity with a high priority, 
                  and the next layer with low priority. Then this 
                  extra layer serves as a monitoring of network 
                  status. With the loss differentiation, the lower 
                  layers will not be effected by the higher layer} 
} 
@inproceedings{RH00, 
  author =	 "Ram Ramanathan and Regina Hain", 
  title =	 "Topology Control of Multihop Wireless Networks Using 
                  Transmit Power Adjustment", 
  crossref =	 "infocom00", 
  pages =	 "404--413", 
  year =	 2000, 
  url = 
                  {}, 
  abstract =	 {We consider the problem of adjusting the transmit 
                  powers of nodes in a multihop wireless network (also 
                  called an ad hoc network) to create a desired 
                  topology. We formulate it as a constrained 
                  optimization problem with two constraints - 
                  connectivity and biconnectivity, and one 
                  optimization objective - maximum power used. We 
                  present two centralized algorithms for use in static 
                  networks, and prove their optimality. For mobile 
                  networks, we present two distributed heuristics that 
                  adaptively adjust} 
} 
@InProceedings{RHE99a, 
  author =	 {Reza Rejaie and Mark Handley and Deborah Estrin}, 
  title =	 {{RAP}: An end-to-end rate-based congestion control 
                  mechanism for realtime streams in the {I}nternet}, 
  crossref =	 "infocom99", 
  abstract =	 {RAP} 
} 
@InProceedings{RHE99b, 
  author =	 {Reza Rejaie and Mark Handley and Deborah Estrin}, 
  title =	 {Quality Adaptation for Congestion Controlled Video 
                  Playback over the {I}nternet}, 
  crossref =	 "sigcomm99", 
  abstract =	 {RAP}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm99/papers/session5-3.html}} 
} 
@Article{RJ90, 
  author =	 {K. K. Ramakrishnan and R. Jain}, 
  title =	 {A Binary Feedback Scheme for Congestion Avoidance in 
                  Computer Networks}, 
  journal =	 tocs, 
  year =	 1990, 
  volume =	 8, 
  number =	 2, 
  pages =	 {158--181}, 
  month =	 May, 
  annote =	 {The first paper on binary feedback congestion 
                  control.}, 
  url = 
                  {\url{http://portal.acm.org/citation.cfm?id=78955&coll=portal&dl=ACM&CFID=533833&CFTOKEN=85945554}} 
} 
@InProceedings{RK01, 
  author =	 {R. Rozovsky and and PR Kumar}, 
  title =	 {Seedex: A mac protocol for ad hoc networks}, 
  crossref =	 {mobihoc01}, 
  url = 
                  {\url{http://black.csl.uiuc.edu/~prkumar/ps\_files/seedex.pdf}} 
} 
@InProceedings{RKT98, 
  author =	 {D. Rubenstein and J. Kurose and D. Towsley}, 
  title =	 {Real-time Reliable Multicast using Proactive Forward 
                  Error Correction}, 
  crossref =	 "nossdav98", 
  year =	 1998, 
  abstract =	 {receiver driver} 
} 
@TechReport{RKT98_TR, 
  author =	 {Dan Rubenstein and Jim Kurose and Don Towsley}, 
  title =	 {Real-Time Reliable Multicast Using Proactive Forward 
                  Error Correction}, 
  institution =	 {Computer Science Department, University of 
                  Massachusetts}, 
  year =	 {1998}, 
  month =	 Mar, 
  number =	 {98-19}, 
  abstract =	 {give Proactive FEC+ARQ approach, and analysis, and 
                  also the model for the burst loss, but this model is 
                  discrete Markov chain} 
} 
@InProceedings{RKT99, 
  author =	 {Dan Rubenstein and Jim Kurose and Don Towsley}, 
  title =	 {The Impact of Multicast Layering on Network 
                  Fairness}, 
  crossref =	 "sigcomm99", 
  abstract =	 { theoretical approach that argues for multiple rate 
                  in multicast (can be as many as the number of 
                  receivers). Propose to use partial layering to 
                  approximate the potential large number of rates. } 
} 
@InProceedings{RKTS94, 
  author =	 {R. Ramjee and J. Kurose and D. Towsley and 
                  H. Schulzrinne}, 
  title =	 {Adaptive playout mechanisms for packetized audio 
                  applications in wide-area networks}, 
  crossref =	 "infocom94", 
  abstract =	 {Recent interest in supporting packet-audio 
                  applications over wide area networks has been fueled 
                  by the availability of low-cost, toll-quality 
                  workstation audio and the demonstration that limited 
                  amounts of interactive audio can be supported by 
                  today's Internet. In such applications, received 
                  audio packets are buffered, and their playout 
                  delayed at the destination host in order to 
                  compensate for the variable network delays. In this 
                  paper we investigate the performance of four 
                  different algorithms for adaptively adjusting the 
                  playout delay of audio packets in an interactive 
                  packet-audio terminal application, in the face of 
                  such varying network delays. We evaluate the playout 
                  algorithms using experimentally-obtained delay 
                  measurements of audio traffic between several 
                  different Internet.} 
} 
@Article{RKWR98, 
  author =	 {J. H. Reed and K. J. Krizman and B. D. Woerner and 
                  T. S. Rappaport}, 
  title =	 {An Overview of the Challenges and Progress in 
                  Meeting the {E911} Requirement for Location Service}, 
  journal =	 {IEEE Communications Magazine}, 
  year =	 1998, 
  volume =	 5, 
  number =	 3, 
  pages =	 {30--37}, 
  annote =	 {location} 
} 
@InProceedings{RLPK01, 
  author =	 {Ramachandran Ramjee and Li Li and Thomas La Porta 
                  and Sneha Kasera}, 
  title =	 {IP Paging Service for Mobile Hosts}, 
  crossref =	 "mobicom01", 
  abstract =	 {In wireless networks, mobile hosts must update the 
                  network with their current location in order to get 
                  packets delivered. Paging facilitates efficient 
                  power management at the mobile host by allowing the 
                  host to update the network less frequently at the 
                  cost of providing the network with only approximate 
                  location information. The network determines the 
                  exact location of a mobile host through paging 
                  before delivering packets destined to the mobile 
                  host. In this paper, we propose the concept of 
                  paging as an IP service. IP paging enables a common 
                  infrastructure and protocol to support the different 
                  wireless interfaces such as CDMA, GPRS, wireless 
                  LAN, avoiding the duplication of several application 
                  layer paging implementations and the 
                  inter-operability issues that exists today. We 
                  present the design, implementation, and detailed 
                  qualitative and quantitative evaluation, using 
                  measurements and simulation, of three IP-based 
                  paging protocols for mobile hosts.} 
} 
@InProceedings{RM98, 
  author =	 {V. Rodoplu and T. Meng}, 
  title =	 {Minimum energy mobile wireless networks}, 
  booktitle =	 {{IEEE} International Conference on Communications}, 
  year =	 1998, 
  address =	 {Atlanta, GA}, 
  month =	 Jun, 
  abstract =	 {Propose an ingenious distributed topology control 
                  algorithm that guarantees connectivity of the entire 
                  network. Their algorithm relies on a simple radio 
                  propagation model for transmit power roll-off as 
                  1/d^n, n >= 2. Using this they achieve the minimum 
                  power topology, which contains the minimum-power 
                  paths from each node to a designated master-site 
                  node.}, 
  url =		 {} 
} 
@inproceedings{RM99, 
  author =	 "Sylvia Ratnasamy and Steven McCanne", 
  title =	 "Inference of Multicast Routing Trees and Bottleneck 
                  Bandwidths Using End-to-end Measurements", 
  crossref =	 "infocom99", 
  pages =	 "353--360", 
  year =	 1999, 
  url =		 {} 
} 
@Misc{RMRG, 
  author =	 {Internet Research Task Force ({IRTF})}, 
  title =	 {Reliable {M}ulticast {R}esearch {G}roup}, 
  howpublished = {\url{http://www.nard.net/~tmont/rm-links.html}} 
} 
@TechReport{ROY00, 
  author =	 {Injong Rhee and Volkan Ozdemir and Yung Yi}, 
  title =	 {{TEAR}: {TCP} Emulation at Receivers --- Flow 
                  Control for Multimedia Streaming}, 
  institution =	 {Department of Computer Science, North Carolina State 
                  University}, 
  address =	 {Raleigh, North Carolina, U.S.A.}, 
  year =	 2000, 
  month =	 Apr 
} 
@InProceedings{RP99, 
  author =	 {E. M. Royer and C. E. Perkins}, 
  title =	 {Multicast operation of the ad-hoc on-demand distance 
                  vector routing protocol}, 
  crossref =	 {mobicom99}, 
  pages =	 {207--218}, 
  year =	 1999, 
  abstract =	 {Multicast AODV}, 
  url =		 {} 
} 
@InProceedings{RPSS03, 
  author =	 {Ananth Rao and Christos Papadimitriou and Scott 
                  Shenker and Ion Stoica}, 
  title =	 {Geographic Routing Without Location Information}, 
  crossref =	 {mobicom03}, 
  pages =	 {96--108}, 
  year =	 2003, 
  url = 
                  {} 
} 
@InProceedings{RQS00, 
  author =	 {Jonathan Rosenberg and Lili Qiu and Henning 
                  Schulzrinne}, 
  title =	 {Integrating packet {FEC} into adaptive voice playout 
                  buffer algorithms on the {I}nternet}, 
  crossref =	 "infocom00", 
  abstract =	 {Transport of real-time voice traffic on the Internet 
                  is difficult due to packet loss and jitter. Packet 
                  loss is handled primarily through a variety of 
                  different forward error correction (FEC) algorithms 
                  and local repair at the receiver. Jitter is 
                  compensated for by means of adaptive playout buffer 
                  algorithms at the receiver. Traditionally, these two 
                  mechanisms have been investigated in isolation. In 
                  this paper, we show the interactions between 
                  adaptive playout buffer algorithms and FEC, and 
                  demonstrate the need for coupling. We propose a 
                  number of novel playout buffer algorithms which 
                  provide this coupling, and demonstrate their 
                  effectiveness through` simulations based on both 
                  network models and real network 
                  traces. Keywords---Packet voice, IP telephony, 
                  packet FEC, playout buffer} 
} 
@article{RR02, 
  author =	 {Indrajit Ray and Indrakshi Ray}, 
  title =	 {Fair exchange in E-commerce}, 
  journal =	 {SIGecom Exchange}, 
  volume =	 3, 
  number =	 2, 
  year =	 2002, 
  pages =	 {9--17}, 
  doi =		 {\url{http://doi.acm.org/10.1145/844340.844345}}, 
  publisher =	 {ACM Press}, 
} 
@Article{RR98, 
  author =	 {Michael K. Reiter and Aviel D. Rubin}, 
  title =	 {Crowds: anonymity for {W}eb transactions}, 
  journal =	 {ACM Transactions on Information and System 
                  Security,}, 
  year =	 1998, 
  volume =	 1, 
  number =	 1, 
  pages =	 {66--92}, 
  annote =	 {crowds} 
} 
@article{RSA93, 
  author =	 {RSA Laboratories}, 
  title =	 {PKCS\#1: RSA Encryption Standard}, 
  journal =	 {Volume1.5, No. 1993}, 
  year =	 {1993}, 
} 
@InProceedings{RSS96, 
  author =	 {W. Ren and K. Siu and H. Suzuki}, 
  title =	 {On the performance of congestion control algorithm 
                  for multicast {ABR} service in {ATM}}, 
  booktitle =	 {Proceedings of IEEE ATM '96 Workshop}, 
  year =	 1996, 
  month =	 Aug, 
} 
@Article{RSS98, 
  author =	 {W. Ren and K.-Y. Siu and H. Suzuki and M. Shinohara}, 
  title =	 {Multipoint-to-multipoint {ABR} Service in {ATM} 
                  Networks}, 
  journal =	 {Computer Networks and ISDN Systems}, 
  year =	 1998, 
  volume =	 30, 
  number =	 19, 
  pages =	 {1793--1810}, 
  month =	 oct, 
  abstract =	 {} 
} 
@Article{RT02, 
  author =	 {T. Roughgarden and E. Tardos}, 
  title =	 {How Bad is Selfish Routing?}, 
  journal =	 {Journal of {ACM}}, 
  volume =	 49, 
  number =	 2, 
  pages =	 "236--259", 
  year =	 2002, 
  url = 
                  {\url{http://www.cs.cornell.edu/timr/papers/routing_full.ps}} 
} 
@Article{RT99, 
  author =	 {E. M. Royer and C. K. Toh}, 
  title =	 {A Review of Current Routing Protocols for Ad Hoc 
                  Mobile Wireless Networks}, 
  journal =	 {{IEEE} Personal Communications}, 
  year =	 1999, 
  pages =	 {46--55}, 
  month =	 Apr 
} 
@inproceedings{RU95, 
  author =	 "Prabhakar Raghavan and Eli Upfal", 
  title =	 "Stochastic contention resolution with short delays", 
  crossref =	 "stoc95", 
  pages =	 "229--237", 
  year =	 1995, 
  abstract =	 {We study contention resolution protocols under a 
                  stochastic model of continuous request generation 
                  from a set of contenders. The performance of such a 
                  protocol is characterized by two parameters: the 
                  maximum arrival rate for which the protocol is 
                  stable and the expected delay of a request from 
                  arrival to service. Known solutions are either 
                  unstable for any constant injection rate, or have 
                  polynomial (in the number of contenders) expected 
                  delay. Our main contribution is a protocol that 
                  is...}, 
  url =		 {} 
} 
@misc{RUDT+03, 
  author =	 "Saikat Ray and Rachanee Ungrangsi and Francesco De 
                  Pellegrini and Ari Trachtenberg and David 
                  Starobinski", 
  title =	 "Robust Location Detection in Emergency Sensor 
                  Networks", 
  abstract =	 {We propose a new framework for providing robust 
                  location detection in emergency response systems, 
                  based on the theory of identifying codes. The key 
                  idea of this approach is to allow sensor coverage 
                  areas to overlap in such a way that each resolvable 
                  position is covered by a unique set of sensors. In 
                  this setting, determining a sensor-placement with a 
                  minimum number of sensors is equivalent to 
                  constructing an optimal identifying code, an 
                  NP-complete problem in general. We thus propose 
                  and... }, 
  url =		 {} 
} 
@Article{RVA00, 
  author =	 {Matthew Roughan, Darryl Veitch, and Patrice Abry}, 
  title =	 {Real-Time Estimation of the Parameters of Long-Range 
                  Dependence}, 
  journal =	 {IEEE/ACM Transaction on Networking}, 
  year =	 2000, 
  volume =	 8, 
  number =	 4, 
  pages =	 {467--478}, 
  url =		 {} 
} 
@Article{RVC01, 
  author =	 {H.M. Radha and M. van der Schaar and Yingwei Chen}, 
  title =	 {The {MPEG}-4 fine-grained scalable video coding 
                  method for multimedia streaming over {IP}}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909594.pdf?isNumber=19626}} 
} 
@Article{RY97, 
  author =	 "C. Rose and R. Yates", 
  title =	 "Location Uncertainty in Mobile Networks: a 
                  theoretical framework", 
  journal =	 {IEEE Communications Magazine}, 
  volume =	 35, 
  number =	 2, 
  pages =	 {94--101}, 
  month =	 Feb, 
  year =	 1997, 
  abstract =	 {As users, services, databases and computers become 
                  increasingly mobile, so fades the era of the fixed 
                  network. Modern networks are becoming mobile 
                  networks which must accommodate a broad range 
                  services with differing mobility 
                  characteristics. Consequently, there is an impetus 
                  to understand mobility and its effect on 
                  communications systems. Of particular interest are 
                  the unique stresses imposed by mobile computing and 
                  especially mobile computer programs (agents). As an 
                  aid to such greater...}, 
  annote =	 {use stochastic ordering and information theory; 
                  mainly it is about how to keep track of users, not 
                  how a user determines its position}, 
  url =		 {} 
} 
@InProceedings{ZRLD03, 
  author =	 {Yin Zhang and Matthew Roughan and Carsten Lund and 
                  David L. Donoho}, 
  title =	 {An information-theoretic approach to traffic matrix 
                  estimation}, 
  crossref =	 {sigcomm03} 
} 
@Misc{Radware, 
  key =		 {Radware}, 
  author =	 {{Radware, Inc.}}, 
  howpublished = 
                  {\url{http://www.radware.com/content/products/pd/default.asp}}, 
  annote =	 {Peer director} 
} 
@Book{Rap01, 
  author =	 {Theodore Rappaport}, 
  title =	 {Wireless Communications: Principles and Practice}, 
  publisher =	 {Prentice Hall}, 
  year =	 2001, 
  edition =	 {2nd}, 
  month =	 Dec 
} 
@InProceedings{Riz00, 
  author =	 {Luigi Rizzo}, 
  title =	 {pgmcc: A TCP-friendly single-rate multicast 
                  congestion control scheme}, 
  crossref =	 "sigcomm00", 
  abstract =	 {this paper identifies the slowest (slowest 
                  throughput calculated by RTT & loss rate) receiver, 
                  and let the receiver response an ACK instead of 
                  NACK, so that the sender can get a quick response 
                  from all receivers. This paper can be used as our 
                  motivation and application of our Pruning 
                  Algorithm. Also the experiment consider two cases: 
                  1. no loss but bandwidth is not enough, so packet 
                  drops are only due to congestion. 2. bandwidth is 
                  big enough, and loss rate and RTT play roles. } 
} 
@misc{Rom01, 
  author =	 {Kay Romer}, 
  title =	 {The Lighthouse Location System for Smart Dust}, 
  url =		 {} 
} 
@misc{Ros00, 
  author =	 {Jonathan Rosenberg}, 
  title =	 {{I}nternet Telephony: A (Partial) Research Agenda}, 
  year =	 {1998}, 
  abstract =	 {This paper describes some of the specific technical 
                  challenges that arise due to these three aspects of 
                  the Internet telephony service, and discusses some 
                  of the author's research so far in resolving 
                  them. As is clear from the discussion so far, there 
                  are many challenges towards providing wide scale 
                  Internet telephony, so this listing here can at best 
                  be considered partial. 2 Transport Protocol Issues} 
} 
@Article{Rosen65, 
  author =	 {J. B. Rosen}, 
  title =	 {Existence and uniqueness of equilibrium points for 
                  concave n-person games}, 
  journal =	 {Econometrica}, 
  year =	 1965, 
  volume =	 33, 
  pages =	 {520--534}, 
  month =	 Jul 
} 
@article{Rot81, 
  author =	 {B. Roth}, 
  title =	 {Rigid and flexible frameworks}, 
  journal =	 {American Mathematical Monthly}, 
  year =	 1981, 
  volume =	 88, 
  pages =	 {6--21}, 
} 
@InProceedings{Rou01, 
  author =	 {T. Roughgarden}, 
  title =	 {Designing Networks for Selfish Users is Hard}, 
  crossref =	 {focs01}, 
  pages =	 {472--481}, 
  year =	 2001, 
  url =		 {} 
} 
@InProceedings{Rou01a, 
  author =	 {T. Roughgarden}, 
  title =	 {Stackelberg Scheduling Strategies}, 
  crossref =	 {stoc01}, 
  pages =	 {104--113}, 
  year =	 2001 
} 
@PhdThesis{Roughgarden02, 
  author =	 {Tim Roughgarden}, 
  title =	 {Selfish Routing}, 
  school =	 {Cornell University}, 
  year =	 2002, 
  month =	 May 
} 
@InProceedings{Roughgarden02:fair, 
  author =	 {T. Roughgarden}, 
  title =	 {How Unfair is Optimal Routing?}, 
  crossref =	 "soda02", 
  year =	 2002 
} 
@TechReport{MQWZ03, 
  author =	 {Z. Mao and L. Qiu and J. Wang and Y. Zhang}, 
  title =	 {Inferring {AS}-level paths with RouteScope}, 
  institution =	 {AT\&T Labs --- Research}, 
  year =	 2003, 
  number =	 {TD-5T3RRP} 
} 
@Misc{RouteScience, 
  key =		 {RouteScience Technologies, Inc.}, 
  author =	 {{RouteScience Technologies, Inc.}}, 
  howpublished = {\url{http://www.routescience.com}}, 
  year =	 2003, 
  month =	 Jun, 
} 
@Misc{RouteScience95P, 
  author =	 {{RouteScience Technologies, Inc.}}, 
  title =	 {Route Optimization for eBusiness Applications}, 
  howpublished = {White Paper. Available at 
                  \url{http://www.routescience.com}}, 
  month =	 Jun, 
  year =	 2003 
} 
@Misc{RouteSciencePrice, 
  author =	 {{RouteScience Technologies, Inc.}}, 
  title =	 {Reengineering {ISP} Connectivity to Lower Bandwidth 
                  Costs}, 
  howpublished = {White Paper. Available at 
                  \url{http://www.routescience.com}}, 
  month =	 Apr, 
  year =	 2002 
} 
@article{S79, 
  author =	 {Adi Shamir}, 
  title =	 {How to Share a Secret}, 
  journal =	 {Communications of the ACM}, 
  pages =	 {612--613}, 
  volume =	 22, 
  number =	 11, 
  month =	 nov, 
  year =	 1979 
} 
@InProceedings{S92, 
  author =	 {Nachum Shacham}, 
  title =	 {Multipoint communication by hierarchically encoded 
                  data}, 
  crossref =	 "infocom92", 
  year =	 1992, 
  abstract =	 {close to optimal partitioning} 
} 
@InProceedings{S96, 
  author =	 {Steven M. Bellovin}, 
  title =	 {Problem Areas for the {IP} Security Protocols}, 
  booktitle =	 {Sixth Usenix Unix Security Symposium}, 
  month =	 Jul, 
  year =	 {1996}, 
  address =	 {San Jose, CA}, 
  abstract =	 {This paper discuss two issues with IPSec ESP issues: 
                  1. confidentiality can be compromised, 2. phony 
                  packets can be generated by attacker. The paper 
                  first discusses limitation of some Block mode and 
                  Stream mode operations. For Block mode operation, 
                  CBC mode is used. The author shows many types of 
                  attack to generate backs in CBC mode. The conclusion 
                  is encryption without integrity checking is all but 
                  useless -- it turned out to be practical to use the 
                  error propagation properties of CBC mode to 
                  construct all manner of useful but fraudulent 
                  packets. To give just one example, an attacker could 
                  splice together the body of a target packet with the 
                  header of a packet destined for his or her program.} 
} 
@article{S97, 
  author =	 {Douglas R. Stinson}, 
  title =	 {On Some Methods for Unconditionally Secure Key 
                  Distribution and Broadcast Encryption}, 
  journal =	 {Designs, Codes and Cryptography}, 
  pages =	 {215--243}, 
  volume =	 12, 
  number =	 3, 
  year =	 1997 
} 
@manual{S99, 
  author =	 {Saha, Debanjan}, 
  title =	 {A toolkit for Secure {I}nternet Multicast, 
                  INTERNET-DRAFT}, 
  year =	 {1999}, 
  month =	 dec, 
  abstract =	 {This design provides a prototype toolkit. Put the 
                  Secure Multicast above the Reliable multicast 
                  layer. The design separates Data plane and the 
                  Control plane. RSA is used for authentication and 
                  Key update is by RM (SRM)} 
} 
@InProceedings{SAAB+99, 
  author =	 {Stefan Savage and Tom Anderson and Amit Aggarwal and 
                  David Becker and Neal Cardwell and Andy Collins and 
                  Eric Hoffman and John Snell and Amin Vahdat and 
                  Geoff Voelker and John Zahorjan}, 
  title =	 {Detour: a Case for Informed {I}nternet Routing and 
                  Transport}, 
  booktitle =	 {{IEEE} {M}icro}, 
  pages =	 {50--59}, 
  year =	 1999, 
  volume =	 19, 
  month =	 Jan, 
  abstract =	 {Detour 2}, 
  url = 
                  {\url{http://www.cs.washington.edu/homes/savage/papers/IEEEMicro99.pdf}} 
} 
@InProceedings{SAZS+02, 
  title =	 {Internet Indirection Infrastructure}, 
  author =	 {Ion Stoica and Daniel Adkins and Shelley Zhuang and 
                  Scott Shenker and Sonesh Surana}, 
  crossref =	 {sigcomm02}, 
  url =		 {} 
} 
@InProceedings{SB00, 
  author =	 {Alex C. Snoeren and Hari Balakrishnan}, 
  title =	 {An End-to-End Approach to Host Mobility }, 
  crossref =	 "mobicom00", 
  abstract =	 {We present the design and implementation of an 
                  end-to-end architecture for host mobility on the 
                  Internet using dynamic updates to the Domain Name 
                  System (DNS) to track network location. Existing TCP 
                  connections are retained using secure and efficient 
                  connection migration, enabling established 
                  connections to seamlessly negotiate a change in 
                  endpoint IP addresses. Our architecture is 
                  secure--name updates are effected via the secure DNS 
                  update protocol, while TCP connection re-addressing 
                  uses a novel set of Migrate options--and provides a 
                  pure end-system alternative to infrastructure-based 
                  approaches such as Mobile IP. Mobile IP was designed 
                  under the assumption that fixed Internet hosts and 
                  applications were to remain unmodified and only the 
                  underlying IP substrate should change. Our 
                  architecture requires no changes to the unicast IP 
                  substrate, instead modifying transport protocols and 
                  applications at the end hosts. We argue that this is 
                  not a hindrance to deployment; rather, in a 
                  significant number of cases, it allows for an easier 
                  deployment path than Mobile IP. We compare and 
                  contrast the strengths of end-to-end and 
                  network-layer mobility schemes, and argue that 
                  end-to-end schemes are better suited to many common 
                  mobile applications. Our performance experiments 
                  show TCP migrate latencies are on the order of a 
                  round-trip time of the communicating peers, and our 
                  architecture scales as well as the DNS even if most 
                  Internet hosts become mobile. } 
} 
@TechReport{SB02, 
  author =	 {Peter Sevcik and John Bartlett}, 
  title =	 {Improving User Experience with Route Control}, 
  institution =	 {NetForecast, Inc.}, 
  year =	 2002, 
  number =	 {NetForecast Report 5062} 
} 
@InProceedings{SBGM00, 
  author =	 {Tajana Simunic and Luca Benini and Peter Glynn and 
                  Giovanni De Micheli}, 
  title =	 {Dynamic Power Management for Portable Systems}, 
  crossref =	 "mobicom00", 
  abstract =	 {Portable systems require long battery lifetime while 
                  still delivering high performance. Dynamic power 
                  management (DPM) policies trade off the performance 
                  for the power consumption at the system level in 
                  portable devices. In this work we present the 
                  time-indexed SMDP model (TISMDP) that we use to 
                  derive optimal policy for DPM in portable 
                  systems. TISMDP model is needed to handle the 
                  non-exponential user request interarrival times we 
                  observed in practice. We use our policy to control 
                  power consumption on three different devices: the 
                  SmartBadge portable device, Sony Vaio laptop hard 
                  disk and WLAN card. Simulation results show large 
                  savings for all three devices when using our 
                  algorithm. In addition, we measured the power 
                  consumption and performance of our algorithm and 
                  compared it with other DPM algorithms for laptop 
                  hard disk and WLAN card. The algorithm based on our 
                  TISMDP model has $1.7$ times less power consumption 
                  as compared to the default Windows timeout policy 
                  for the hard disk and three times less power 
                  consumption as compared to the default algorithm for 
                  the WLAN card. } 
} 
@InProceedings{SBGP04, 
  author =	 {Adam Smith and Hari Balakrishnan and Michel Goraczko 
                  and Nissanka B. Priyantha}, 
  title =	 {Tracking Moving Devices with the Cricket Location 
                  System }, 
  crossref =	 {mobisys04}, 
  url = 
                  {\url{http://www.sds.lcs.mit.edu/papers/tracking_mobisys04.html}}, 
  annote =	 {location} 
} 
@InProceedings{SBMPW00, 
  author =	 {David Steere and Antonio Baptista and Dylan Mcnamee 
                  and Calton Pu and Jonathan Walpole}, 
  title =	 {Research Challenges in Environmental Observation and 
                  Forecasting Systems}, 
  crossref =	 "mobicom00", 
  abstract =	 {We describe Environmental Observation and 
                  Forecasting Systems (EOFS), a new class of 
                  large-scale distributed system designed to monitor, 
                  model, and forecast wide-area physical processes 
                  such as river systems. EOFS have strong social 
                  relevance in areas such as education, 
                  transportation, agriculture, natural resource 
                  planning and disaster response. In addition, they 
                  represent an opportunity for scientists to study 
                  large physical systems to an extent that was not 
                  previously possible. Building the next generation of 
                  EOFS pose a number of difficult challenges in all 
                  aspects of wireless networking, including media 
                  protocols for long distance vertical communication 
                  through water, flooding algorithms in ad-hoc network 
                  topologies, support for rate- and time-sensitive 
                  applications, and location-dependent mobile 
                  computing. }, 
  url = 
                  {\url{http://www.cc.gatech.edu/~calton/publications/mobicom-00.pdf}} 
} 
@InProceedings{SC02, 
  author =	 {Akis Spyropoulos and Cauligi Raghavendra}, 
  title =	 {Energy Efficient Communications in Ad Hoc Networks 
                  Using Directional Antennas }, 
  crossref =	 {infocom02}, 
  year =	 2002, 
  url =		 {\url{http://www.ieee-infocom.org/2002/papers/289.pdf}} 
} 
@Article{SCEH96, 
  author =	 {S. Shenker and D. Clark and D. Estrin and S. Herzog}, 
  title =	 {Pricing in Computer Networks: Reshaping the Research 
                  Agenda}, 
  journal =	 {Communications Policy}, 
  year =	 1996, 
  volume =	 20, 
  number =	 1, 
  annote =	 {The more academic literature has largely focused on 
                  devising optimal pricing policies; achieving optimal 
                  welfare requires charging marginal congestion costs 
                  for usage. In this paper we critique this optimality 
                  paradigm ... we contend that the research agenda on 
                  pricing in computer networks should shift away from 
                  the optimality paradigm and focus more on structural 
                  and architectural issues. There is a list 
                  maintained by Richard Gibbens' on Pricing Internet 
                  Resources (Last modified in 1998.). }, 
  url =		 {} 
} 
@InProceedings{SCHS+99, 
  author =	 {Stefan Savage and Andy Collins and Eric Hoffman and 
                  John Snell and Tom Anderson}, 
  title =	 {The End-to-end Effects of {I}nternet Path Selection}, 
  crossref =	 {sigcomm99}, 
  pages =	 {289--299}, 
  year =	 1999, 
  abstract =	 {Detour 1}, 
  url = 
                  {\url{http://www.cs.washington.edu/research/networking/detour/}} 
} 
@InProceedings{SCHSA99, 
  author =	 {S. Savage and A. Collins and E. Hoffman and J. Snell 
                  and T. Anderson}, 
  title =	 {The End-to-End Effects of {I}nternet Path Selection}, 
  crossref =	 "sigcomm99", 
  year =	 1999, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm99/papers/session8-2.html}} 
} 
@InProceedings{SCIMSWC01, 
  author =	 {Eugene Shih and SeongHwan Cho and Nathan Ickes and 
                  Rex Min and Amit Sinha and Alice Wang and Anantha 
                  Chandrakasan}, 
  title =	 {Physical-Layer Driven Protocol and Algorithm Design 
                  for Energy-Efficient Wireless Sensor Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {The potential for collaborative, robust networks of 
                  microsensors has attracted a great deal of research 
                  attention. For the most part, this is due to the 
                  compelling applications that will be enabled once 
                  wireless microsensor networks are in place; 
                  location-sensing [Priyantha00], environmental 
                  sensing [Kahn99], medical monitoring and similar 
                  applications are all gaining interest. For network 
                  researchers, however, wireless microsensor networks 
                  pose numerous design challenges. For example, due to 
                  the size of these networks, one challenge is to 
                  devise an efficient method to access the sensor data 
                  from nodes in the network. For applications 
                  requiring long-term, robust sensing, such as 
                  military reconnaissance, an even more important 
                  challenge is to design wireless sensor networks that 
                  have long system lifetimes and fault tolerance. This 
                  challenge is especially difficult due to the 
                  energy-constrained nature of the devices. In order 
                  to design networks that have extremely long 
                  lifetimes, we propose a physical-layer driven 
                  approach to designing protocols and algorithms for 
                  such networks. We first present a hardware model for 
                  our wireless sensor node and then introduce the 
                  design of physical-layer aware protocols, 
                  algorithms, and applications that minimize energy 
                  consumption of the system. Our approach can be used 
                  at different levels of the hierarchy to take 
                  advantage of the underlying hardware. Furthermore, 
                  we also attempt to reduce energy consumption through 
                  algorithm and protocol techniques that deal with the 
                  non-idealities of the underlying hardware.} 
} 
@InProceedings{SCLGC03, 
  author =	 {S. Sharma and J. Chen and W. Li and K. Gopalan and 
                  T. Chiueh}, 
  title =	 {Duplex: A Reusable Fault Tolerance Extension 
                  Framework for Network Access Devices}, 
  booktitle =	 {Proceedings of 2003 International Conference on 
                  Dependable Systems and Networks ({DSN} 2003)}, 
  year =	 2003, 
  month =	 Jun, 
  url =		 {} 
} 
@InProceedings{SCN03, 
  author =	 {Samarth H. Shah and Kai Chen and Klara Nahrstedt}, 
  title =	 {Dynamic Bandwidth Management for Single-Hop Ad Hoc 
                  Wireless Networks}, 
  booktitle =	 {Proceedings of First {IEEE} International Conference 
                  on Pervasive Computing and Communications 
                  ({PerCom}'03) }, 
  year =	 2003, 
  month =	 Mar, 
  url = 
                  {\url{http://www.computer.org/proceedings/percom/1893/18930195abs.htm}} 
} 
@InProceedings{SCP95, 
  author =	 {H. Sariowan and R. L. Cruz and G. C. Polyzos}, 
  title =	 {Scheduling for Quality of Service Guarantees via 
                  Service Curves}, 
  crossref =	 {icccn95}, 
  url =		 {\url{http://www-ece.ucsd.edu/~cruz/papers/ProcICCCN95.ps}}, 
  pages =	 {512--520}, 
  year =	 1995 
} 
@Article{SCWA99, 
  author =	 {Stefan Savage and Neal Cardwell and David Wetherall 
                  and Tom Anderson}, 
  title =	 {{TCP} Congestion Control with a Misbehaving 
                  Receiver}, 
  journal =	 ccr, 
  year =	 1999, 
  volume =	 29, 
  number =	 5, 
  month =	 Oct, 
  url =		 {} 
} 
@inproceedings{SDC97, 
  author =	 "Devika Subramanian and Peter Druschel and Johnny 
                  Chen", 
  title =	 "Ants and Reinforcement Learning: A Case Study in 
                  Routing in Dynamic Networks", 
  booktitle =	 "Proceedings of {IJCAI}", 
  pages =	 "832--839", 
  year =	 1997, 
  url =		 {} 
} 
@InProceedings{SG04, 
  author =	 {Qixiang Sun and Hector Garcia-Molina}, 
  title =	 {SLIC: A Selfish Link-based Incentive Mechanism for 
                  Unstructured Peer-to-Peer Networks}, 
  booktitle =	 {Proceedings of {ICDCS} '04}, 
  year =	 2004, 
  url =		 {\url{http://www-db.stanford.edu/~qsun/research/picky.pdf}} 
} 
@InProceedings{SG99, 
  author =	 {Clay Shields and J.J. Garcia-Luna-Aceves}, 
  title =	 {{KHIP} - A Scalable Protocol for Secure Multicast 
                  Routing}, 
  crossref =	 "sigcomm99", 
  abstract =	 {Secure multicast routing} 
} 
@InProceedings{SGAM+03, 
  author =	 {A. Savvides and W. Garber and S. Adlakha and 
                  R. Moses and M. B. Srivastava}, 
  title =	 {On the Error Characteristics of Multihop Node 
                  Localization in Ad-Hoc Sensor Networks}, 
  booktitle =	 {Proceedings of the 2nd International Workshop on 
                  Information Processing in Sensor Networks 
                  ({IPSN'03})}, 
  year =	 2003, 
  address =	 {Palo Alto, CA}, 
  month =	 Apr, 
  annote =	 {Cramer-Rao lower bound}, 
  url = 
                  {\url{http://nesl.ee.ucla.edu/projects/ahlos/reports/savvides_ipsn03.pdf}} 
} 
@Article{SH03-ieeesp, 
  author =	 {Xiaohong Sheng and Yu-Hen Hu}, 
  title =	 {Maximum Likelihood Wireless Sensor Network Source 
                  Localization Using Acoustic Signal Energy 
                  Measurements}, 
  journal =	 {IEEE Transactions on Signal Processing}, 
  year =	 2003 
} 
@InProceedings{SH03-ipsn03, 
  author =	 {Xiaohong Sheng and Yu Hen Hu}, 
  title =	 {Energy Based Acoustic Source Localization}, 
  crossref =	 {ipsn03}, 
  year =	 2003 
} 
@manual{SHA, 
  title =	 "Secure hash standard", 
  organization = "Federal Information Processing Standards Publication 
                  180-1", 
  year =	 1995 
} 
@InProceedings{SHG04, 
  author =	 {Karim Seada and Ahmed Helmy and Ramesh Govindan}, 
  title =	 {On the Effect of Localization Errors on Geographic 
                  Face Routing in Sensor Networks}, 
  crossref =	 {ipsn04}, 
  year =	 2004 
} 
@Misc{SHM, 
  key =		 {SHM}, 
  author =	 {DARPA}, 
  title =	 {Self-Healing Minefield}, 
  howpublished = {\url{http://www.darpa.mil/ato/programs/SHM/}} 
} 
@inproceedings{SHS01, 
  author =	 "Andreas Savvides and Chih-Chieh Han and Mani 
                  B. Strivastava", 
  title =	 "Dynamic fine-grained localization in Ad-Hoc networks 
                  of sensors", 
  crossref =	 "mobicom01", 
  pages =	 "166--179", 
  year =	 2001, 
  url =		 {} 
} 
@InProceedings{SHS01:1, 
  author =	 {Andreas Savvides and Chih-Chien Han and Mani 
                  Srivastava}, 
  title =	 {Dynamic Fine-Grained Localization in Ad-Hoc Networks 
                  of Sensors}, 
  crossref =	 "mobicom01", 
  abstract =	 {Wireless communication systems have become 
                  increasingly common because of advances in radio and 
                  embedded system technologies. In recent years, a new 
                  class of applications that networks these wireless 
                  devices together is evolving. A representative of 
                  this class that has received considerable attention 
                  from the research community is the wireless sensor 
                  network. Such a sensor networks consist of numerous 
                  tetherless devices that are released into the 
                  environment and organize themselves in an ad-hoc 
                  fashion. The goal of the network is to perform a 
                  monitoring task, and knowledge the physical location 
                  of the individual nodes is therefore essential. Not 
                  only is this information needed for the sensor 
                  network to report the location where events take 
                  place, it also assists in group-querying or routing 
                  traffic to a designated geographic destination and 
                  provides information on physical network 
                  coverage. However, equipping every node with a GPS 
                  receiver is not always feasible due to possible 
                  obstructions in the path of the satellite signals or 
                  energy limitations in the nodes. In this paper, we 
                  present a novel location discovery approach, which 
                  we call AHLoS (Ad-Hoc Localization System), for 
                  wireless sensor networks. Only a small fraction of 
                  the nodes start with knowledge of their location and 
                  the others dynamically estimate their positions via 
                  a distributed algorithm. Furthermore, our algorithm 
                  utilizes a new iterative multi-lateration technique, 
                  such that all nodes that meet some simple 
                  connectivity requirements are eventually able to 
                  determine their position. We have analyzed the 
                  operation of AHLoS, designed a new testbed of 
                  wireless sensor nodes and verified the behavior of 
                  our distributed localization technique. The results 
                  obtained from the testbed are then incorporated in a 
                  simulation platform to perform scalability tests and 
                  evaluate the effects of error propagation.} 
} 
@TechReport{SHS93, 
  author =	 {National Institute of Standards and Technology}, 
  title =	 {Secure Hash Standard}, 
  institution =	 {U.S. Department of Commerce}, 
  type =	 {NIST FIPS}, 
  number =	 {PUB 180}, 
  month =	 May, 
  year =	 1993 
} 
@Article{SK02, 
  author =	 {Asim Smailagic and David Kogan}, 
  title =	 {Location sensing and privacy in a context-aware 
                  computing environment}, 
  journal =	 {IEEE Wireless Communications}, 
  year =	 2002, 
  volume =	 9, 
  pages =	 {10--17}, 
  month =	 Oct, 
  annote =	 {location} 
} 
@article{SK98, 
  author =	 "Mark Stemm and Randy H. Katz", 
  title =	 "Vertical Handoffs in Wireless Overlay Networks", 
  journal =	 "Mobile Networks and Applications", 
  volume =	 3, 
  number =	 4, 
  pages =	 "335--350", 
  year =	 1998, 
  url =		 {} 
} 
@InProceedings{SKJH00, 
  author =	 {Sanjeev Setia and Samir Koussih and Sushil Jajodia 
                  and Eric Harder}, 
  title =	 {Kronos: A Scalable Group Re-Keying Approach for 
                  Secure Multicast}, 
  booktitle =	 {Proceedings of IEEE Symposium on Security and 
                  Privacy}, 
  year =	 2000, 
  month =	 May, 
  address =	 {Berkeley, CA} 
} 
@Article{SKK01, 
  author =	 {Jitae Shin and Jong Won Kim and C.-C.J. Kuo}, 
  title =	 {Quality-of-service mapping mechanism for packet 
                  video in differentiated services network}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 2, 
  month =	 Sep, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19975/00923821.pdf?isNumber=19975}} 
} 
@InProceedings{SKVB00, 
  author =	 {R. Sivakumar and T. Kim and N. Venkitaraman and 
                  V. Bharghavan}, 
  title =	 {Achieving Per-Flow Weighted Rate Fairness in a 
                  Core-Stateless Network}, 
  booktitle =	 {ICDCS 2000}, 
  year =	 2000, 
  address =	 {Taipei, Taiwan}, 
  month =	 Apr, 
  url =		 {} 
} 
@InProceedings{SL00, 
  author =	 {Clay Shields and Brian Neil Levine}, 
  title =	 {A protocol for anonymous communication over the 
                  {I}nternet}, 
  booktitle =	 {Proceedings of {ACM} Computer and Communications 
                  Security ({CCS})}, 
  crossref =	 {ccs00}, 
  year =	 2000 
} 
@Article{SL01, 
  title =	 {Power-Aware Localized Routing in Wireless Networks}, 
  author =	 {Ivan Stojmenovic and Xu Lin}, 
  journal =	 {{IEEE} Transactions on Parallel and Distributed 
                  Systems}, 
  year =	 2001, 
  volume =	 12, 
  number =	 11, 
  pages =	 {1122--1133}, 
  month =	 Nov 
} 
@InProceedings{SL99, 
  author =	 {I. Stojmenovic and X. Lin}, 
  title =	 {{GEDIR}: Loop-free location based routing in 
                  wireless networks}, 
  booktitle =	 {{ASTED} International Conference on Parallel and 
                  Distributed Computing and System}, 
  year =	 1999, 
  month =	 Nov, 
  annote =	 {GEDIR}, 
  url =		 {} 
} 
@InProceedings{KLS04, 
  author =	 {Murali Kodialam and T. V. Lakshman and Sudipta Sengupta}, 
  title =	 {Efficient and Robust Routing of Highly Variable Traffic}, 
  crossref =	 {hotnets04}, 
  url = 
                  {} 
} 
@Article{Val82, 
  author =	 {L. G. Valiant}, 
  title =	 {A scheme for fast parallel communication}, 
  journal =	 {{SIAM} Journal on Computing}, 
  year =	 1982, 
  volume =	 11, 
  number =	 7, 
  pages =	 {350-361} 
} 
@InProceedings{ZM04, 
  author =	 {Rui Zhang-Shen and Nick McKeown}, 
  title =	 {Designing a Predictable {I}nternet Backbone Network}, 
  crossref =	 {hotnets04}, 
  url = 
                  {} 
} 
@InProceedings{SCEH+04, 
  author =	 {Lakshminarayanan Subramanian and Matthew Caesar and 
                  Cheng Tien Ee and Mark Handley and Z. Morley Mao and 
                  Scott Shenker and Ion Stoica}, 
  title =	 {Towards a Next Generation Inter-domain Routing 
                  Protocol}, 
  crossref =	 {hotnets04}, 
  url = 
                  {\url{http://ramp.ucsd.edu/conferences/HotNets-III/HotNets-III-Proceedings/hlphotnets.pdf}} 
} 
@InProceedings{SCEH+05, 
  author =	 {Lakshminarayanan Subramanian and Matthew Caesar and 
                  Cheng Tien Ee and Mark Handley and Z. Morley Mao and 
                  Scott Shenker and Ion Stoica}, 
  title =	 {{HLP}: A Next Generation Inter-domain Routing Protocol}, 
  year =	 2005, 
  crossref =	 {sigcomm05} 
} 
@InProceedings{KKDC05, 
  author =	 {Srikanth Kandula and Dina Katabi and Bruce Davie and 
                  Anna Charny}, 
  title =	 {Walking the Tightrope: Responsive Yet Stable Traffic 
                  Engineering}, 
  year =	 2005, 
  crossref =	 {sigcomm05} 
} 
@InProceedings{XZB05, 
  author =	 {Kuai Xu and Zhi-Li Zhang and Supratik Bhattacharya}, 
  title =	 {Profiling {I}nternet Backbone Traffic: Behavior 
                  Models and Applications}, 
  year =	 2005, 
  crossref =	 {sigcomm05} 
} 
@InProceedings{MWA04, 
  author =	 {Ratul Mahajan and David Wetherall and Thomas 
                  Anderson}, 
  title =	 {Towards Coordinated Interdomain Traffic Engineering}, 
  crossref =	 {hotnets04}, 
  url = 
                  {\url{http://ramp.ucsd.edu/conferences/HotNets-III/HotNets-III/Proceedings/te-arch.pdf}} 
} 
@InProceedings{MRWZ04, 
  author =	 {Ratul Mahajan and Maya Rodrig and David Wetherall 
                  and John Zahorjan}, 
  title =	 {Experiences Applying Game Theory to System Design}, 
  crossref =	 {pins04}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm2004/workshop_papers/pin30-mahajan11.pdf}}, 
  annote =	 {Proposes NP, a negotiation framework which uses 
                  preference lists to compute a solution acceptable to 
                  both ISPs. [erran]: There are many issues 
                  unaddressed by NP. The paper sets preference for 
                  each prefix. However, it is often the case that, an 
                  ISP has a preference over a given prefix to egress 
                  mapping. As acknowledged in the paper, the benefits 
                  come from negotiation over many flows where some 
                  flows may not improve. Can we express this 
                  preference that is polynomial in the input size? The 
                  negotiation process is not rigorously studied. What 
                  is the computational complexity? How good can it be 
                  analytically when compared with the optimal? How can 
                  the nego. process end up with a good solution in 
                  polynomial steps? If not, can simple 
                  privacy-preserving techniques be used to realize 
                  this? } 
} 
@InProceedings{AW04, 
  author =	 {Mike Afergan and John Wroclawski}, 
  title =	 {On the Benefits and Feasibility of Incentive Based 
                  Routing Infrastructure}, 
  crossref =	 {pins04}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm2004/workshop_papers/pin19-afergan11.pdf}}, 
  annote =	 {Argue that explicit incentives (prices) should be 
                  introduced into the routing fabric of the 
                  Internet. Propose user-directed routing [Note other 
                  user-directed routing schemes: Xiaowei Yang. Nira: a 
                  new Internet routing} 
} 
@InProceedings{MWA02, 
  author =	 {Ratul Mahajan and David Wetherall and Tom Anderson}, 
  title =	 {Understanding BGP Misconfiguration}, 
  crossref =	 {sigcomm02}, 
  year =	 2002, 
  url =		 {\url{http://www.acm.org/sigcomm/sigcomm2002/papers.html}} 
} 
@InProceedings{SMA03, 
  author =	 {Neil Spring and Ratul Mahajan and Tom Anderson}, 
  title =	 {Quantifying the Causes of Path Inflation}, 
  crossref =	 {sigcomm03}, 
  year =	 2003, 
  url =		 {\url{http://www.acm.org/sigcomm/sigcomm2003/papers.html}} 
} 
@InProceedings{SMP01, 
  author =	 {Mani Srivastava and Richard Muntz and Miodrag 
                  Potkonjak}, 
  title =	 {Smart Kindergarten: Sensor-based Wireless Networks 
                  for Smart Developmental Problem-solving 
                  Environments}, 
  crossref =	 "mobicom01", 
  abstract =	 {Despite enormous progress in networking and 
                  computing technologies, their application has 
                  remained restricted to conventional person-to-person 
                  and person-to-computer communication. However, 
                  continual reduction in cost and form factor is now 
                  making it possible to imbed networking - even 
                  wireless networking - and computing capabilities not 
                  just in our PCs and laptops but also other 
                  objects. Further, a marriage of these ever tinier 
                  and cheaper processors and wireless network 
                  interfaces with emerging micro-sensors based on MEMS 
                  technology is allowing cheap sensing, processing, 
                  and communication capabilities to be unobtrusively 
                  embedded in familiar physical objects. The result is 
                  an emerging paradigm shift where the primary role of 
                  information technology would be to enhance or assist 
                  in person to physical world communication via 
                  familiar physical objects with embedded (a) 
                  micro-sensors to react to external stimuli, and (b) 
                  wireless networking and computing engines for 
                  tetherless communication with compute servers and 
                  other networked embedded objects. In this paper we 
                  present the application of sensor-based wireless 
                  networks to a Smart Kindergarten that we are 
                  developing to target developmental problem-solving 
                  environments for early childhood education. This is 
                  a natural application as young children learn by 
                  exploring and interacting with objects such as toys 
                  in their environment. Our envisioned system would 
                  enhance the education process by providing a 
                  childhood learning environment that is 
                  individualized to each child, adapts to the context, 
                  coordinates activities of multiple children, and 
                  allows continual unobtrusive evaluation of the 
                  learning process by the teacher. This would be done 
                  by wirelessly-networked, sensor-enhanced toys and 
                  other classroom objects with back-end middleware 
                  services and database techniques. We explore 
                  wireless networking, middleware, and data management 
                  technologies for realizing this application, and 
                  describe challenges arising from ad hoc distributed 
                  structure, unreliable sensing, large scale/density, 
                  and novel sensor data types that are characteristic 
                  of such deeply instrumented environments with 
                  inter-networked physical objects.} 
} 
@Article{SMP02, 
  author =	 {S. Slijepcevic and S. Megerian and M. Potkonjak.}, 
  title =	 {Location Errors in Wireless Embedded Sensor 
                  Networks: Sources, Models, and Effects on 
                  Applications}, 
  journal =	 {ACM Mobile Computing and Communications Review}, 
  year =	 2002, 
  volume =	 6, 
  number =	 3, 
  pages =	 {67--78}, 
  month =	 Jul, 
  abstract =	 {Wireless sensor networks monitor the physical world 
                  by taking measurements of physical phenomena. Those 
                  measurements, and consequently the results computed 
                  from the measurements, may be significantly 
                  inaccurate. Therefore, in order to properly design 
                  and use wireless sensor networks, one must develop 
                  methods that take error sources, error propagation 
                  through optimization software, and ultimately their 
                  impact on applications, into consideration. In this 
                  paper, we focus on location discovery induced 
                  errors. We have selected location discovery as the 
                  object of our case study since essentially all 
                  sensor network computation and communication tasks 
                  are dependent on geographical node location 
                  data. First, we model the error in input parameters 
                  of the location discovery process. Then, we study 
                  the impact of errors on three selected applications: 
                  exposure, best- and worst-case coverage, and 
                  shortest path routing. Furthermore, we examine how 
                  the choice of a specific objective function 
                  optimized during the location discovery process 
                  impacts the errors in results of different 
                  applications.}, 
  url = 
                  {\url{http://www.cs.ucla.edu/~miodrag/papers/Slijepcevic_MCC_02.pdf}} 
} 
@misc{SMUG, 
  author =	 {Internet Research Task Force ({IRTF})}, 
  title =	 {The Secure Multicast Research Group ({SMuG})}, 
  note =	 {\url{http://www.ipmulticast.com/community/smug/}} 
} 
@InProceedings{SMW02, 
  author =	 "N. Spring and R. Mahajan and D. Wetherall", 
  title =	 "Measuring {ISP} Topologies with {R}ocketfuel", 
  crossref =	 "sigcomm02", 
  year =	 "2002" 
} 
@Article{SN01, 
  author =	 {S.D. Sevetto and K. Nahrstedt}, 
  title =	 {Broadcast quality video over {IP}}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909603.pdf?isNumber=19626}} 
} 
@InProceedings{SNCR03, 
  author =	 {Vikram Srinivasan and Pavan Nuggehalli and 
                  Carla-Fabiana Chiasserini and Ramesh Rao}, 
  title =	 {Cooperation in Wireless Ad Hoc Networks}, 
  crossref =	 {infocom03}, 
  year =	 2003, 
  url =		 {\url{http://www.ieee-infocom.org/2003/papers/20_02.PDF}} 
} 
@Misc{SNP99, 
  author =	 {N. Seddigh and B. Nandy and P. Pieda}, 
  title =	 {Study of {TCP} and {UDP} Interaction for {AF} {PHB}}, 
  year =	 1999, 
  month =	 Sep, 
  howpublished = {IETF Internet-Draft, 
                  draft-nsbnppdiffserv-tcpudpaf-01.pdf}, 
  abstract =	 {Intserv} 
} 
@TechReport{SP00, 
  author =	 {D. X. Song and A. Perrig}, 
  title =	 {Advanced and Authenticatd Marking Schemes for {IP} 
                  Traceback}, 
  institution =	 {UC Berkeley}, 
  year =	 2000, 
  number =	 {UCB/CSD-00-1107}, 
  url = 
                  {\url{http://paris.cs.berkeley.edu/~perrig/projects/iptraceback/tr-iptrace.pdf}} 
} 
@InProceedings{SP03, 
  author =	 {Jeffrey Shneidman and David C. Parkes}, 
  title =	 {Using Redundancy to Improve Robustness of 
                  Distributed Mechanism Implementations}, 
  crossref =	 {ec03}, 
  year =	 2003 
} 
@manual{SPG97, 
  author =	 {S. Shenker and C. Partridge and R. Guerin}, 
  title =	 {Specification of Guaranteed Quality of Service, 
                  {RFC} 2212}, 
  year =	 "1997", 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2212.html}} 
} 
@InProceedings{SPS02, 
  author =	 {A. Savvides, H. Park and M. B. Srivastava}, 
  title =	 {The Bits and Flops of the N-Hop Multilateration 
                  Primitive for Node Localization Problems}, 
  booktitle =	 {Proceedings of the First International Workshop on 
                  Wireless Networks and Applications}, 
  year =	 2002, 
  address =	 {Rome, Italy}, 
  month =	 Jul, 
  annote =	 {}, 
  url = 
                  {\url{http://nesl.ee.ucla.edu/projects/ahlos/reports/wsna_final.ps}} 
} 
@InProceedings{SR04, 
  author =	 {Yi Shang and Wheeler Ruml}, 
  title =	 {Improved {MDS}-Based Localization}, 
  crossref =	 "infocom04" 
} 
@Article{SR92, 
  author =	 {S.Y. Seidel and T.S. Rapport}, 
  title =	 {914 {MHz} Path Loss Prediction Model for Indoor 
                  Wireless Communication in Multifloored Buildings}, 
  journal =	 {IEEE Transactions on Antennas and Propagation}, 
  year =	 1992, 
  volume =	 40, 
  number =	 2, 
  pages =	 {207--217}, 
  month =	 Feb 
} 
@Article{SR98, 
  author =	 {S. Singh and C. Raghavendra}, 
  title =	 {{PAMAS} - power aware multi-access protocol with 
                  signalling for ad hoc networks}, 
  journal =	 {ACM Computer Communications Review}, 
  year =	 1998, 
  abstract =	 { Based on MACA with the addition of a separate 
                  signaling channel for RTS-CTS dialogue. Upon 
                  receiving, receiver transmit a busy tone over the 
                  signaling channel; Power off nodes not actively 
                  transmitting or receiving to conserve battery 
                  power. Problem: a sleeping node using IEEE 802.11 
                  may find the link busy and does not know how long 
                  the transmission will last. Uses a control 
                  channel. Query by binary search.}, 
  url =		 {} 
} 
@InProceedings{SRB01, 
  author =	 {Shriram Sarvotham and Rudolf Riedi and Richard 
                  Baraniuk}, 
  title =	 {Connection-level Analysis and Modeling of Network 
                  Traffic}, 
  crossref =	 {imc01}, 
  year =	 2001, 
  url = 
                  {\url{http://www.icir.org/vern/imw-2001/imw2001-papers/81.ps.gz}}, 
  abstract =	 {} 
} 
@Article{SRC84, 
  author =	 {J. Saltzer and D. Reed and D. Clark}, 
  title =	 {End-to-end Arguments in System Design}, 
  journal =	 tocs, 
  year =	 1984, 
  abstract =	 {The design end-to-end design principal. See 
                  \cite{Cla88} for the design on Internet with 
                  end-to-end consideration. See \cite{Cla00} for 
                  review of the principal in the current Internet. The 
                  function in question can completely and correctly be 
                  implemented only with the knowledge and help of the 
                  application standing at the endpoints of the 
                  communications system. Therefore, providing that 
                  questioned function as a feature of the 
                  communications systems itself is not possible. The 
                  primary example of this end to end reasoning about 
                  application functions is the assurance of accurate 
                  and reliable transfer of information across the 
                  network. Even if any one lower level subsystem, such 
                  as a network, tries hard to ensure reliability, data 
                  can be lost or corrupted after it leaves that 
                  subsystem. The ultimate check of correct execution 
                  has to be at the application level, at the endpoints 
                  of the transfer.}, 
  url = 
                  {\url{http://web.mit.edu/Saltzer/www/publications/endtoend/endtoend.pdf}} 
} 
@PhdThesis{Fer03, 
  author =	 {Pedro M. Ferreira}, 
  title =	 {Interconnected Communication Networks Provisioned 
                  Selfishly: Implications for Industry Structure and 
                  Public Policy}, 
  school =	 {Carnegie Mellon University}, 
  year =	 2003 
} 
@article{HSS03, 
  author =	 {Oliver Heckmann and Jens Schmitt and Ralf Steinmetz}, 
  title =	 {Optimizing interconnection policies}, 
  journal =	 {Computer Networks}, 
  volume =	 46, 
  number =	 1, 
  year =	 2004, 
  issn =	 {1389-1286}, 
  pages =	 {19--39}, 
  doi =		 {http://dx.doi.org/10.1016/j.comnet.2004.03.017}, 
  publisher =	 {Elsevier North-Holland, Inc.}, 
} 
@InProceedings{SRL02, 
  author =	 {C. Savarese and J. Rabay and K. Langendoen}, 
  title =	 {Robust Positioning Algorithms for Distributed Ad-Hoc 
                  Wireless Sensor Networks}, 
  booktitle =	 {{USENIX} Technical Annual Conference}, 
  address =	 {Monterey, CA}, 
  month =	 Jun, 
  year =	 2002, 
  annote =	 {In the start-up phase we use Hop-TERRAIN, an 
                  in-house algorithm similar to DV-hop [10]. The 
                  Hop-TERRAIN algorithm is run once at the beginning 
                  of the positioning algorithm to overcome the sparse 
                  anchor node problem, and the Refinement algorithm is 
                  run iteratively afterwards to improve upon and 
                  refine the position estimates generated by 
                  Hop-TERRAIN.}, 
  abstract =	 {A distributed algorithm for determining the 
                  positions of nodes in an ad-hoc, wireless sensor 
                  network is explained in detail. Details regarding 
                  the implementation of such an algorithm are also 
                  discussed. Experimentation is performed on networks 
                  containing 400 nodes randomly placed within a square 
                  area, and resulting error magnitudes are represented 
                  as percentages of each node's radio range. In 
                  scenarios with 5\% errors in distance measurements, 
                  5\% anchor node population (nodes with known 
                  locations), and average connectivity levels between 
                  neighbors of 7 nodes, the algorithm is shown to have 
                  errors less than 33\% on average. It is also shown 
                  that, given an average connectivity of at least 12 
                  nodes and 10\% anchors, the algorithm performs well 
                  with up to 40\% errors in distance measurements.}, 
  url =		 {} 
} 
@Misc{SRP02, 
  author =	 {Galen Schreck and Charles Rustein and Marli Porth}, 
  title =	 {The End of the Private {WAN}}, 
  howpublished = {Forrester Brief}, 
  month =	 Mar, 
  year =	 2002 
} 
@InProceedings{SRZF03, 
  author =	 {Yi Shang and Wheeler Ruml and Ying Zhang and Markus 
                  Fromherz}, 
  title =	 {Localization from Mere Connectivity}, 
  crossref =	 {mobihoc03}, 
  year =	 2003, 
  month =	 Jun, 
  url = 
                  {\url{http://www.sigmobile.org/mobihoc/2003/papers/p201-shang.pdf}} 
} 
@InProceedings{SS01, 
  author =	 {Srisankar Kunniyur and R. Srikant}, 
  title =	 {Analysis and Design of an Adaptive Virtual Queue 
                  ({AVQ}) Algorithm for Active Queue Management}, 
  crossref =	 {sigcomm01}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm2001/p10.html}} 
} 
@Unpublished{SS02, 
  author =	 {Slobodan Simic and Shankar Sastry}, 
  title =	 {A Distributed Algorithm for Localization in Random 
                  Wireless Networks}, 
  annote =	 {}, 
  year =	 {2002}, 
} 
@InProceedings{SS98, 
  author =	 {Dorgham Sisalem and Henning Schulzrinne}, 
  title =	 {The Loss-Delay Based Adjustment Algorithm: A 
                  {TCP}-Friendly Adaptation Scheme}, 
  crossref =	 "nossdav98", 
  abstract =	 {LDA} 
} 
@InProceedings{SSAK+01, 
  author =	 {A. Smailagic and D. P. Siewiorek and J. Anhalt and 
                  D. Kogan and Y. Wang}, 
  title =	 {Location Sensing and Privacy in a Context Aware 
                  Computing Environment}, 
  booktitle =	 {Pervasive Computing}, 
  year =	 2001, 
  annote =	 {location} 
} 
@Article{SSB99, 
  author =	 {R. Sivakumar and P. Sinha and V. Bharghavan}, 
  title =	 {{CEDAR}: a core-extraction distributed ad hoc 
                  routing algorithm}, 
  journal =	 {{IEEE} Journal on Selected Areas in Communications}, 
  year =	 1999, 
  volume =	 17, 
  pages =	 {1454--1465}, 
  month =	 Aug, 
  url =		 {} 
} 
@InProceedings{SSV01, 
  author =	 {Jack Snoeyink and Subhash Suri and George Varghese}, 
  title =	 {A Lower Bound for Multicast Key Distribution}, 
  crossref =	 "infocom01", 
  abstract =	 {Lower bound} 
} 
@InProceedings{SSV99, 
  author =	 {V. Srinivasan and S. Suri and G. Varghese}, 
  title =	 {Packet Classification Using Tuple Space Search}, 
  crossref =	 "sigcomm99", 
  pages =	 {135--146}, 
  year =	 1999, 
  url = 
                  {\url{http://www.acm.org/pubs/citations/proceedings/comm/316188/p135-srinivasan/}} 
} 
@InProceedings{SSZ98, 
  author =	 {Ion Stoica and Scott Shenker and Hui Zhang}, 
  title =	 {Core-Stateless Fair Queueing: A Scalable 
                  Architecture to Approximate Fair Bandwidth 
                  Allocations in High Speed Networks}, 
  crossref =	 "sigcomm98", 
  abstract =	 {CSFQ} 
} 
@InProceedings{ST00:alg, 
  author =	 {Saswati Sarkar and Leandros Tassiulas}, 
  title =	 {Distributed Algorithms for Computation of Fair Rates 
                  in Multirate Multicast Trees}, 
  crossref =	 "infocom00", 
  abstract =	 {An distributed algorithm to calculate multicast 
                  max-min rate for the above.} 
} 
@InProceedings{ST00:fair, 
  author =	 {Saswati Sarkar and Leandros Tassiulas}, 
  title =	 {Fair Allocation of Discrete Bandwidth Layers in 
                  Multicast Networks}, 
  crossref =	 "infocom00", 
  abstract =	 {Consider fixed layer bandwidth case } 
} 
@InProceedings{ST93, 
  author =	 {M. Spreitzer and M. Theimer}, 
  title =	 {Providing location information in a ubiquitous 
                  computing environment}, 
  booktitle =	 {sosp93}, 
  year =	 1993, 
  annote =	 {location} 
} 
@InProceedings{STHK01, 
  author =	 {Bill N. Schilit and Jonathan Trevor and David 
                  M. Hilbert and Tzu Khiau Koh}, 
  title =	 {m-Links: An Infrastructure for Very Small {I}nternet 
                  Devices}, 
  crossref =	 "mobicom01", 
  abstract =	 {In this paper we describe the Mobile Link (m-Links) 
                  infrastructure for utilizing existing World Wide Web 
                  content and services on wireless phones and other 
                  very small Internet terminals. Very small devices, 
                  typically with 3-20 lines of text, provide 
                  portability and other functionality while 
                  sacrificing usability as Internet terminals. In 
                  order to provide access on such limited hardware we 
                  propose a small device web navigation model that is 
                  more appropriate than the desktop computers web 
                  browsing model. We introduce a middleware proxy, the 
                  Navigation Engine, to facilitate the navigation 
                  model by concisely displaying the Webs link (i.e., 
                  URL) structure. Because not all Web information is 
                  appropriately linked, the Navigation Engine 
                  incorporates data-detectors to extract bits of 
                  useful information such as phone numbers and 
                  addresses. In order to maximize program-data 
                  composibility, multiple network-based services 
                  (similar to browser plug-ins) are keyed to a links 
                  attributes such as its MIME type. We have built this 
                  system with an emphasis on user extensibility and we 
                  describe the design and implementation as well as a 
                  basic set of middleware services that we have found 
                  to be particularly important.} 
} 
@Article{SW01, 
  author =	 {Xiao Su and W. Web}, 
  title =	 {Multidescription video streaming with optimized 
                  reconstruction-based {DCT} and neural-network 
                  compensations}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909599.pdf?isNumber=19626}} 
} 
@InProceedings{SWKA00, 
  author =	 {Stefan Savage and David Wetherall and Anna Karlin 
                  and Tom Anderson}, 
  title =	 {Practical Network Support for IP Traceback}, 
  crossref =	 "sigcomm00", 
  abstract =	 {marking algorithm for DDoS}, 
  url = 
                  {\url{http://www.cs.washington.edu/homes/savage/papers/Sigcomm00.pdf}} 
} 
@InProceedings{SY98, 
  author =	 {Sano T. and Yamanouchi N.}, 
  title =	 {Flow and Congestion Control for Bulk Reliable 
                  Multicast Protocols - toward coexistence with {TCP}}, 
  crossref =	 "infocom98", 
  abstract =	 {see add and drop} 
} 
@InProceedings{Sax79, 
  author =	 {J.B. Saxe}, 
  title =	 {Embeddability of weighted graphs in k-space is 
                  strongly {NP}-hard}, 
  booktitle =	 {Proceedings of the 17th {Allerton} Conference in 
                  Communications, Control and Computing}, 
  pages =	 {480--489}, 
  year =	 1979 
} 
@InProceedings{Sch89, 
  author =	 {C.P. Schnorr}, 
  title =	 {Efficient Signature Generation for Smart Cards}, 
  booktitle =	 crypto89, 
  pages =	 {239--252}, 
  publisher =	 {Springer-Verlag}, 
  year =	 1990 
} 
@article{Schnorr91, 
  author =	 {C.P. Schnorr}, 
  title =	 {Efficient Signature Generation for Smart Cards}, 
  journal =	 {Journal of Cryptology}, 
  pages =	 {161--174}, 
  volume =	 4, 
  number =	 3, 
  year =	 1991 
} 
@Book{Sen81, 
  author =	 {E. Seneta}, 
  title =	 {Non-negative Matrices and {M}arkov Chains}, 
  publisher =	 {Springer Verlag}, 
  year =	 1981, 
  address =	 {New York, NY} 
} 
@Book{She85, 
  author =	 {Yosef Sheffi}, 
  title =	 {Urban Transportation Networks: Equilibrium Analysis 
                  with Mathematical Programming Methods}, 
  publisher =	 {Prentice-Hall}, 
  year =	 1985 
} 
@Article{She95:game, 
  author =	 {Scott Shenker}, 
  title =	 {Making Greedy Work in Networks: A Game-Theoretic 
                  Analysis of Switch Service Disciples}, 
  journal =	 ton, 
  volume =	 3, 
  year =	 1995, 
} 
@Article{She95:issues, 
  author =	 {S. Shenker}, 
  title =	 {Fundamental Design Issues for the Future {I}nternet}, 
  journal =	 jsac, 
  year =	 1995, 
  volume =	 13, 
  number =	 7, 
  pages =	 {1176--1188}, 
  month =	 Sep, 
  url = 
                  {} 
} 
@Misc{Smi01, 
  author =	 {P. Smith}, 
  title =	 {{BGP} multihoming technique. {NANOG} 23}, 
  howpublished = {\url{http://www.nanog.org/mtg-0110/smith.html}}, 
  month =	 Oct, 
  year =	 2001 
} 
@InProceedings{Sne01, 
  author =	 {E. Snekkenes}, 
  title =	 {Concepts for Personal Location Privacy Policies}, 
  crossref =	 {ec01}, 
  pages =	 {48--57}, 
  annote =	 {location} 
} 
@InProceedings{Sprite, 
  crossref =	 {ZCY03} 
} 
@manual{Ste97, 
  author =	 {W. Stevens}, 
  title =	 {{TCP} congestion control, {RFC} 2001}, 
  month =	 Jan, 
  year =	 1997, 
  abstract =	 {}, 
  url = 
                  {\url{http://community.roxen.com/developers/idocs/rfc/rfc2001.html}} 
} 
@Book{Ste97:vol1, 
  author =	 {Wright Stevens}, 
  title =	 {{TCP/IP} Illustrated, Volume 1: The Protocols}, 
  publisher =	 {Addison-Wesley}, 
  year =	 1997, 
} 
@Book{Ste97:vol2, 
  author =	 {Wright Stevens}, 
  title =	 {{TCP/IP} Illustrated, Volume 2: The Implementation}, 
  publisher =	 {Addison-Wesley}, 
  year =	 1997, 
} 
@Book{Sti95, 
  author =	 {Douglas R. Stinson}, 
  title =	 {Cryptography: Theory and Practice}, 
  publisher =	 {{CRC} Press}, 
  year =	 1995 
} 
@Unpublished{SubATM, 
  author =	 {Mahesh Subramanyan}, 
  title =	 {Asynchronous Transfer Mode Tutorial}, 
  note =	 {From web}, 
  abstract =	 {}, 
  http = 
                  {\url{http://www.npac.syr.edu/users/mahesh/homepage/atm_tutorial/}} 
} 
@Article{Swe02, 
  author =	 {L. Sweeney}, 
  title =	 {k-anonymity: a model for protecting privacy}, 
  journal =	 {International Journal on Uncertainty, Fuzziness and 
                  Knowledge-based Systems}, 
  year =	 2002, 
  volume =	 10, 
  number =	 5, 
  pages =	 {557--570} 
} 
@InProceedings{TA95, 
  author =	 {Rajesh Talpade and Mostafa H. Ammar}, 
  title =	 {Single Connection Emulation (SCE): An Architecture 
                  for Providing a Reliable Multicast Transport 
                  Service}, 
  booktitle =	 {15th IEEE International Conference on Distributed 
                  Computing Systems}, 
  year =	 1995 
} 
@Unpublished{TA97, 
  author =	 {Transport Area - FDDIFS BOF}, 
  title =	 {\url{http://www.ietf.org/proceedings/97apr}}, 
  annote =	 {Transport area}, 
  month =	 Apr, 
  year =	 {1997}, 
} 
@InProceedings{TB00, 
  author =	 {Diane Tang and Mary Baker}, 
  title =	 {Analysis of a Local-Area Wireless Network}, 
  crossref =	 "mobicom00", 
  abstract =	 {To understand better how users take advantage of 
                  wireless networks, we examine a twelve-week trace of 
                  a building-wide local-area wireless network. We 
                  analyze the network for overall user behavior (when 
                  and how intensively people use the network and how 
                  much they move around), overall network traffic and 
                  load characteristics (observed throughput and 
                  symmetry of incoming and outgoing traffic), and 
                  traffic characteristics from a user point of view 
                  (observed mix of applications and number of hosts 
                  connected to by users). Amongst other results, we 
                  find that users are divided into distinct 
                  location-based sub-communities, each with its own 
                  movement, activity, and usage characteristics. Most 
                  users exploit the network for web-surfing, 
                  session-oriented activities and chat-oriented 
                  activities. The high number of chat-oriented 
                  activities shows that many users take advantage of 
                  the mobile network for for synchronous communication 
                  with others. In addition to these user-specific 
                  results, we find that peak throughput is usually 
                  caused by a single user and application. Also, while 
                  incoming traffic dominates outgoing traffic overall, 
                  the opposite tends to be true during periods of peak 
                  throughput, implying that significant asymmetry in 
                  network capacity could be undesirable for our 
                  users. While these results are only valid for this 
                  local-area wireless network and user community, we 
                  believe that similar environments may exhibit 
                  similar behavior and trends. We hope that our 
                  observations will contribute to a growing 
                  understanding of mobile user behavior. } 
} 
@manual{TCP81, 
  author =	 {{USC/ISI}}, 
  title =	 {Transmission Control Protocol, {RFC} 793}, 
  year =	 "1981", 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc793.html}} 
} 
@InProceedings{TDH02, 
  author =	 {Patrick Thiran and Olivier Dousse and Martin Hasler}, 
  title =	 {Connectivity in Ad-Hoc and Hybrid Networks}, 
  crossref =	 {infocom2002}, 
  year =	 2002, 
  month =	 Jun, 
  url =		 {} 
} 
@InProceedings{TG99, 
  author =	 {Z.Tang and J.J.Garcia-Luna-Aceves}, 
  title =	 {A protocol for topology-dependent transmission 
                  scheduling in wireless networks}, 
  booktitle =	 {IEEE {WCNC}}, 
  year =	 1999, 
  address =	 {New Orleans, LA}, 
  url = 
                  {\url{http://www.cse.ucsc.edu/research/ccrg/publications/kevin.wcnc99.pdf}} 
} 
@InProceedings{TGS01, 
  author =	 {H. Tangmunarunkit and R. Govindan and S. Shenker}, 
  title =	 {Internet path inflation due to policy routing}, 
  booktitle =	 {Proceedings of {SPIE} {ITCom}}, 
  year =	 2001, 
  address =	 {Denver, CO}, 
  month =	 Aug 
} 
@InProceedings{ACBD04, 
  author =	 {Sharad Agarwal and Chen-Nee Chuah and Supratik 
                  Bhattacharyya and Christophe Diot}, 
  title =	 {The Impact of {BGP} Dynamics on Intra-Domain 
                  Traffic}, 
  crossref =	 {sigmetrics04} 
} 
@InProceedings{TGSE01, 
  author =	 "H. Tangmunarunkit and R. Govindan and S. Shenker and 
                  D. Estrin", 
  title =	 "The Impact of Routing Policy on {I}nternet Paths", 
  crossref =	 {infocom01}, 
  month =	 Apr, 
  year =	 2001, 
} 
@Article{TJ96, 
  author =	 {D. L. Tennenhouse and D. J. Wetherall}, 
  title =	 {Towards an Active Network Architecture}, 
  journal =	 ccr, 
  year =	 1996, 
  volume =	 26, 
  number =	 2, 
  month =	 Apr, 
  url =		 {\url{http://www.tns.lcs.mit.edu/publications/ccr96.html}} 
} 
@Article{TK75, 
  author =	 {F.A. Tobagi and L. Kleinrock}, 
  title =	 {Packset switching in radio channels: Part {II} - the 
                  Hidden Terminal Problem in Carrier Sense Multiple 
                  Access Modes and the Busy-Tone Solution}, 
  journal =	 {IEEE Transactions on Communications}, 
  year =	 1975, 
  volume =	 23, 
  pages =	 {1417--1433}, 
  annote =	 {Propose BTMA. Assume a base station.} 
} 
@Article{TK76, 
  author =	 {F.A. Tobagi and L. Kleinrock}, 
  title =	 {Packset switching in radio channels: Part {III} - 
                  Polling and (dynamic) split channel reservation 
                  Multiple Access}, 
  journal =	 {IEEE Transactions on Communications}, 
  year =	 1976, 
  volume =	 24, 
  number =	 7, 
  pages =	 {832--845}, 
  annote =	 {Propose SRMA.} 
} 
@Article{TKP97, 
  author =	 {Towsley, D. and Kurose, J. and Pingali, S.}, 
  title =	 {A comparison of sender-initiated reliable multicast 
                  and receiver-initiated reliable multicast protocols}, 
  journal =	 jsac, 
  year =	 {1997}, 
  volume =	 {15}, 
  number =	 {3}, 
  pages =	 {398--406}, 
  abstract =	 {} 
} 
@InProceedings{TM03, 
  author =	 {V. Tadic and S.P. Meyn}, 
  title =	 {Asymptotic Properties of Two Time-Scale Stochastic 
                  Approximation Algorithms with Constant Step Sizes}, 
  booktitle =	 {Proceedings of the 2003 {A}merican Control 
                  Conference}, 
  year =	 2003, 
  month =	 Jun, 
  annote =	 {Constant stepsize. Prove convergence when alpha and 
                  beta go to zero}, 
  url = 
                  {\url{http://decision.csl.uiuc.edu/\verb$~$meyn/pages/sa9spm.PS}} 
} 
@InProceedings{TSGR04, 
  author =	 {Renata Teixeira and Aman Shaikh and Tim Griffin and 
                  Jennifer Rexford}, 
  title =	 {Dynamics of Hot-Potato Routing in {IP} Networks}, 
  crossref =	 {sigmetrics04}, 
  url = 
                  {\url{http://www.cs.ucsd.edu/~voelker/pubs/hot-potato-sigmet04.pdf}} 
} 
@InProceedings{TGSV04, 
  author =	 {R. Teixeira and T. Griffin and A. Shaikh and 
                  G.M. Voelker}, 
  title =	 {Network Sensitivity to Hot-Potato Disruptions}, 
  crossref =	 {sigcomm04}, 
  year =	 2004, 
  url = 
                  {\url{http://www.cse.ucsd.edu/users/teixeira/p347-teixeira.pdf}} 
} 
@InProceedings{TMSV03:char, 
  author =	 {Renata Teixeira and Keith Marzullo and Stefan Savage 
                  and Geoffrey M. Voelker}, 
  title =	 {Characterizing and Measuring Path Diversity of 
                  {I}nternet Topologies}, 
  crossref =	 {sigmetrics03}, 
  year =	 2003, 
  month =	 Jun, 
  url = 
                  {\url{http://portal.acm.org/citation.cfm?id=781069&jmp=references&dl=portal&dl=ACM}} 
} 
@InProceedings{TMSV03:search, 
  author =	 {Renata Teixeira and Keith Marzullo and Stefan Savage 
                  and Geoffrey M. Voelker}, 
  title =	 {In Search of Path Diversity in {ISP} Networks}, 
  crossref =	 {imc03}, 
  year =	 2003, 
  month =	 Oct, 
  url = 
                  {\url{http://www.cs.ucsd.edu/users/voelker/pubs/path-diversity-imc03.pdf}} 
} 
@Article{TMW97, 
  author =	 {Kevin Thompson and Gregory J. Miller and Rick 
                  Wilder}, 
  title =	 {Wide-area {I}nternet Traffic Patterns and 
                  Characteristics}, 
  journal =	 {IEEE Network}, 
  year =	 1997, 
  volume =	 11, 
  number =	 6, 
  month =	 nov, 
  abstract =	 {The major traffic of Internet is TCP traffic} 
} 
@Misc{TNTP, 
  key =	 {TNTP}, 
  title =	 {TNTP}, 
  howpublished = {\url{http://www.bgu.ac.il/\verb$~$bargera/tntp/}} 
} 
@Misc{TPB97, 
  author =	 {Thierry Turletti and Sacha Fosse Parisis and 
                  Jean-Chrysostome Bolot}, 
  title =	 {Experiments with a layered transmission scheme over 
                  the {I}nternet}, 
  howpublished = {Research Report No 3296, INRIA}, 
  month =	 nov, 
  year =	 1997, 
  annote =	 {In this paper, a receiver initially joins the base 
                  layer, measure loss rate and rtt to determine the 
                  TCP formula rate. It then joins the group. It does 
                  not consider the relationship between loss rate and 
                  send rate. However, because the protocol is 
                  evaluated under MBone, which is a high multiplexing 
                  environment. It appears to be OK.} 
} 
@InProceedings{TPB98, 
  author =	 {T. Turletti and S. F. Parisis and J. Bolot}, 
  title =	 {Experiments with a Layered Transmission Scheme over 
                  the {I}nternet}, 
  crossref =	 "infocom98", 
  abstract =	 {In this paper, a receiver initially joins the base 
                  layer, measure loss rate and rtt to determine the 
                  TCP formula rate. It then joins the group. It does 
                  not consider the relationship between loss rate and 
                  send rate. However, because the protocol is 
                  evaluated under MBone, which is a high multiplexing 
                  environment. It appears to be OK.} 
} 
@Article{TS97, 
  author =	 {H. Tzeng and K. Siu}, 
  title =	 {On Max-min Fairness Congestion Control for Multicast 
                  {ABR} Service in {ATM}}, 
  journal =	 {JSAC}, 
  year =	 1997, 
  volume =	 15, 
  number =	 3, 
  month =	 Apr, 
  abstract =	 {Discuss multicast max-min with a single multicast 
                  session rate (slowest receiver) } 
} 
@Article{TSSW+97, 
  author =	 {David L. Tennenhouse and Jonathan M. Smith and 
                  W. David Sincoskie and David J. Wetherall and Gary 
                  J. Minden}, 
  title =	 {A Survey of Active Network Research }, 
  journal =	 {IEEE Communications Magazine}, 
  year =	 1997, 
  volume =	 35, 
  number =	 1, 
  pages =	 {80--86}, 
  month =	 Jan, 
  abstract =	 {}, 
  url = 
                  {\url{http://tns-www.lcs.mit.edu/publications/ieeecomms97.html}} 
} 
@InProceedings{TVGS00, 
  author =	 {C. K. Toh and V. Vassiliou and G. Guichal and 
                  C. H. Shih}, 
  title =	 {{MARCH}: A Medium Access Control Protocol for 
                  Multihop Wireless Ad Hoc Networks}, 
  booktitle =	 {{MILCOM} 2000}, 
  year =	 2000, 
  month =	 Oct, 
  annote =	 {Overhear CTS, and then send invitation. Idea extedn 
                  MACA-BI, invented by Fabrizio Talucci; Two way 
                  handshake; Replace RTS and CTS with RTR (Ready to 
                  receive); Receiver initiated. Address the problem of 
                  MACA-BI, which has has to PREDICT if its neighbors 
                  have data to transmit to it}, 
  url =		 {} 
} 
@TechReport{TY97, 
  author =	 {J. Turner and N. Yamanaka}, 
  title =	 {Architectural Choices in Large Scale {ATM} Switches}, 
  url = 
                  {\url{http://www.cs.wustl.edu/cs/techreports/1997/wucs-97-21.ps.Z}}, 
  institution =	 {Washington University at St. Louis}, 
  year =	 1997, 
  number =	 {WUCS97-21}, 
  month =	 May 
} 
@Article{TZ99, 
  author =	 {Wai-Tian Tan and Avideh Zakhor}, 
  title =	 {Real-time {I}nternet video using error resilient 
                  scalable compression and {TCP}-friendly transport 
                  protocol}, 
  journal =	 itm, 
  volume =	 1, 
  number =	 2, 
  year =	 1999, 
  month =	 jun, 
  url =		 {} 
} 
@Book{Tan96, 
  author =	 {Andrew S. Tanenbaum}, 
  title =	 {Computer Networks}, 
  publisher =	 {Prentice Hall}, 
  year =	 1996, 
  edition =	 {3rd}, 
  month =	 Mar 
} 
@Misc{Tho98, 
  author =	 {V. Thomas}, 
  title =	 {{IP} Multicast in {RealSystem} {G2}}, 
  month =	 Jan, 
  year =	 1998, 
  howpublished = {White paper, RealNetworks}, 
  note =	 {Available at \url{http://service.real.com/}}, 
  abstract =	 {UDP no congestion control} 
} 
@Book{Tip91, 
  author =	 {Paul A. Tipler}, 
  title =	 {Physics For Scientists and Engineers}, 
  publisher =	 {Worth Publishers}, 
  year =	 1991, 
  edition =	 {3rd}, 
} 
@Book{Toh01 , 
  author =	 {C-K Toh}, 
  title =	 {Ad Hoc Mobile Wireless Networks: Protocols and 
                  Systems}, 
  publisher =	 {Prentice Hall PTR}, 
  year =	 2001 
} 
@Article{Tok97, 
  author =	 {C.-K. Toh}, 
  title =	 {Associativity based routing for ad hoc mobile 
                  networks}, 
  journal =	 {Wireless Personal Communications}, 
  year =	 1997, 
  month =	 Mar 
} 
@Article{Tou80, 
  author =	 {G. Toussaint}, 
  title =	 {The relative neighborhood graph of a finite planr 
                  set}, 
  journal =	 {Pattern Recognition}, 
  year =	 1980, 
  volume =	 12, 
  number =	 4, 
  pages =	 {261--268}, 
  url =		 {} 
} 
@InProceedings{Ts98, 
  author =	 {Gene Tsudik}, 
  title =	 {{CLIQUE} }, 
  booktitle =	 ccr, 
  year =	 {1998}, 
  month =	 oct, 
  abstract =	 {The target environment is a relatively small groups, 
                  the membership is dynamic, there is no hierarchy, 
                  and the multicast can be m-m. The Services it 
                  provided include: decentralized authenticated key 
                  agreement with provable security based on group 
                  Diffie-Hellman: each member contribute equally to 
                  the group key; membership change can be single, or 
                  many, or subgroup. Membership authentication is 
                  based on group key share; authenticated join/leave 
                  needs DH credentials. } 
} 
@Article{UR94, 
  author =	 {S. Uryas'ev and R. Y. Rubinstein}, 
  title =	 {On relaxation algorithms in computation of 
                  noncooperative equilibria}, 
  journal =	 {{IEEE} Transactions on Automatic Control}, 
  year =	 1995, 
  volume =	 39, 
  number =	 6, 
  pages =	 {1263--1267}, 
  month =	 Jun 
} 
@InProceedings{UTN00, 
  author =	 {Hirotaka Ueda and Masahiko Tsukamoto and Shojiro 
                  Nishio}, 
  title =	 {W-MAIL: An Electronic Mail System for Wearable 
                  Computing Environments}, 
  crossref =	 "mobicom00", 
  abstract =	 {This paper describes an e-mail system for wearable 
                  computing environments. In this system, we extend 
                  the conventional mail format and the server / client 
                  (browser) architecture by considering the specific 
                  features of wearable computing environments, i.e., 
                  full time operation, hands-free use of computer, and 
                  close relationship to our daily life. A mail author 
                  can specify the behavior of his/her mail by 
                  embedding in the mail several commands useful in the 
                  environment. A user can specify in the mail various 
                  conditions as commands such as time, location of the 
                  recipient, and status of various sensors to allow an 
                  adaptive behavior in the mail. We also describe 
                  other features to support wearable computing. } 
} 
@Misc{UsagePricing, 
  author =	 {Hal R. Varian}, 
  title =	 {Usage Based Pricing Web Site}, 
  howpublished = 
                  {\url{http://www.sims.berkeley.edu/resources/infoecon/Pricing.html}} 
} 
@InProceedings{VAD99, 
  author =	 {A. Vahdat and T. Anderson and M. Dahlin}, 
  title =	 {Active Naming: Programmable Location and Transport 
                  of Wide-Area Resources}, 
  crossref =	 "usits99", 
  url =		 {\url{http://www.cs.duke.edu/~vahdat/ps/an.pdf}}, 
  year =	 1999 
} 
@InProceedings{VBG00, 
  author =	 {Nitin Vaidya and Paramvir Bahl and Seema Gupta}, 
  title =	 {Distributed Fair Scheduling in a Wireless LAN}, 
  crossref =	 "mobicom00", 
  abstract =	 {Fairness is an important issue when accessing a 
                  shared wireless channel. With fair scheduling, it is 
                  possible to allocate bandwidth in proportion to 
                  weights of the packet flows sharing the 
                  channel. This paper presents a fully distributed 
                  algorithm for fair scheduling in a wireless LAN. The 
                  algorithm can be implemented without using a 
                  centralized coordinator to arbitrate medium 
                  access. The proposed protocol is derived from the 
                  Distributed Coordination Function in the IEEE 802.11 
                  standard. Simulation results show that the proposed 
                  algorithm is able to schedule transmissions such 
                  that the bandwidth allocated to different flows is 
                  proportional to their weights. An attractive feature 
                  of the proposed approach is that it can be 
                  implemented with simple modifications to the IEEE 
                  802.11 standard. } 
} 
@Article{VC94, 
  author =	 {L. N. Vicente and P. H. Calamai}, 
  title =	 {Bilevel and multilevel programming: a bibliography 
                  review}, 
  journal =	 {Journal of Global Optimization}, 
  year =	 1994, 
  volume =	 5, 
  pages =	 {291--306}, 
  url =		 {\url{http://www.mat.uc.pt/\verb$~$lnv/papers/bilevel.ps}} 
} 
@InProceedings{VC94, 
  author =	 {M. Vishwanath and P. Chou}, 
  title =	 {An efficient algorithm for hierarchical compression 
                  of video}, 
  booktitle =	 {Proceedings of IEEE International Conference on 
                  Image Processing}, 
  year =	 1994, 
  month =	 nov 
} 
@Article{VCB+95, 
  author =	 {T. Vicsek and A. Czirok and E. Ben Jacob and 
                  I. Cohen and O. Schochet}, 
  title =	 {Novel Type of Phase Transitions in a System of 
                  Self-driven Particles}, 
  journal =	 {Physical Review Letters}, 
  year =	 1995, 
  volume =	 75, 
  pages =	 {1226--1229} 
} 
@InProceedings{VEF98, 
  author =	 {K. Varadhan and D. Estrin and S. Floyd}, 
  title =	 {Impact of Network Dynamics on End-to-End Protocols: 
                  Case Studies in Reliable Multicast}, 
  booktitle =	 {ISCC '98}, 
  year =	 1998, 
  address =	 {Athens, Greece}, 
  month =	 Jun, 
  url =		 {\url{http://lecs.cs.ucla.edu/~estrin/papers/iscc98.ps.gz}} 
} 
@InProceedings{LHH05, 
  author =	 {Yuxi Li and Janelle Harms and Robert Holte}, 
  title =	 {A simple method for balancing network utilization 
                  and quality of routing}, 
  booktitle =	 {Proceedings of {ICCCN}}, 
  year =	 2005, 
  address =	 {San Diego, CA} 
} 
@InProceedings{VL02, 
  author =	 {Shahrokh Valaee and Baochun Li}, 
  title =	 {Distributed Call Admission Control in Wireless Ad 
                  Hoc Networks}, 
  booktitle =	 {Proceedings of the 11th IEEE International 
                  Conference on Computer Communications and Networks 
                  ({ICCCN} 2002)}, 
  address =	 {Miami, FL}, 
  month =	 {Oct.}, 
  year =	 {2002}, 
  url =		 {\url{http://www.eecg.toronto.edu/~bli/papers/vtc02.pdf}}, 
  abstract =	 {} 
} 
@InProceedings{VLB00, 
  author =	 {M. Vojnovic and J. Y. Le Boudec and C. Boutremans}, 
  title =	 {Global fairness of additive-increase and 
                  multiplicative-decrease with heterogeneous 
                  round-trip times}, 
  crossref =	 {infocom00}, 
  url = 
                  {\url{http://icawww.epfl.ch/ICApublic/asp/publication_abstract.asp?ID=355}} 
} 
@InProceedings{VRC99, 
  author =	 {Lorenzo Vicisano and Luigi Rizzo and Jon Crowcroft}, 
  title =	 {{TCP}-like Congestion Control for Layered Multicast 
                  Data Transfer}, 
  crossref =	 "infocom99", 
  abstract =	 {Add and drop layers in an interesting pattern} 
} 
@InProceedings{Vam83, 
  author =	 {D. R. Vaman}, 
  title =	 {A method of data and voice integration, digital 
                  silence detection for satellite applications}, 
  crossref =	 "globecom83", 
  abstract =	 {Studied voice traffic using {\em coefficient of 
                  variance}. Argue that delay must be kept to a 
                  reasonable value for fluid conversation, but it is 
                  the ratio of jitter and delay that determines if the 
                  conversation will be intelligible. According to 
                  Vaman, The CoV must be 0.3 or less to achieve 
                  intelligible packetized voice communication.} 
} 
@Article{Var96, 
  author =	 {Y. Vardi}, 
  title =	 {Network Tomography: Estimating Source-Destination 
                  Traffic Intensities From Link Data}, 
  journal =	 {J. Amer. Stat. Assoc.}, 
  year =	 1996, 
  pages =	 {365--377} 
} 
@InCollection{Vic01, 
  author =	 {L. N. Vicente}, 
  title =	 {Bilevel programming: Introduction, history and 
                  overview}, 
  booktitle =	 {Encyclopedia of Optimization}, 
  pages =	 {178--180}, 
  publisher =	 {Kluwer Academic Publishers}, 
  year =	 2001, 
  editor =	 {C. A. Floudas and P. M. Pardalos}, 
  volume =	 1, 
  url =		 {\url{http://www.mat.uc.pt/\verb$~$lnv/papers/EoO.ps}} 
} 
@Article{Vic61, 
  author =	 {W. Vickrey}, 
  title =	 {Counterspeculation, Auctions, and Competitive Sealed 
                  Tenders}, 
  journal =	 {Journal of Finance}, 
  year =	 1961, 
  volume =	 16, 
  pages =	 {8--37} 
} 
@Misc{Vin00, 
  author =	 {G. Vinnicombe}, 
  title =	 {On the stability of end-to-end congestion control 
                  for the {I}nternet}, 
  howpublished = 
                  {\url{http://www-control.eng.cam.ac.uk/Homepage/accessible_papers/TR398.ps}}, 
  year =	 2000, 
  url = 
                  {\url{http://www-control.eng.cam.ac.uk/Homepage/accessible_papers/TR398.ps}} 
} 
@InProceedings{WA00, 
  author =	 {Wenye Wang and Ian F. Akyildiz}, 
  title =	 {Intersystem Location Update and Paging Schemes for 
                  Multitier Wireless Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {Global wireless networks enable mobile users to 
                  communicate regardless of their locations. One of 
                  the most important issues is location management in 
                  a highly dynamic environment because mobile users 
                  may roam between different wireless networks, 
                  network operators, and geographical regions. In this 
                  paper, a location tracking mechanism is introduced, 
                  which consists of intersystem location updates using 
                  the concept of a boundary location area (BLA) and 
                  paging using the concept of a boundary location 
                  register (BLR). The BLA is determined by a dynamic 
                  location update policy in which the velocity and the 
                  quality of service (QoS) are taken into account on a 
                  per-user basis. The BLR is used to maintain the 
                  records of mobile users crossing the boundary of 
                  networks. This mechanism not only reduces location 
                  tracking costs but also significantly decreases call 
                  loss rates and average paging delays. The 
                  performance evaluation of the proposed schemes is 
                  provided to demonstrate their effectiveness in 
                  multitier wireless networks.} 
} 
@InProceedings{WA01, 
  author =	 {Wenye Wang and Ian Akyildiz}, 
  title =	 {A Cost-Efficient Signaling Protocol for Mobility 
                  Application Part ({MAP}) in {IMT}-2000 Systems}, 
  crossref =	 "mobicom01", 
  abstract =	 {Efficient signaling protocol for mobility 
                  application part (MAP) is essential to support 
                  mobility when the mobile terminals roam between 
                  different networks in next generation wireless 
                  systems such as IMT-2000. In this paper, a new 
                  signaling protocol is proposed to reduce the 
                  overhead caused by mobility management, alleviating 
                  network load and consumption of network 
                  resources. Moreover, the new protocol effectively 
                  reduces the latency of call delivery and call loss 
                  rate due to crossing wireless systems with different 
                  standards and signaling protocols. Instead of 
                  performing location registration when a mobile user 
                  arrives at the new system, the mobile user is 
                  required to update its location information prior to 
                  its reaching the boundary of two systems. Results in 
                  this study demonstrate that the new protocol yields 
                  significant benefits in terms of reducing signaling 
                  costs, delays, and call loss rates.} 
} 
@Unpublished{WB04, 
  author =	 {David H. Wolpert and Stefan Bieniawski}, 
  title =	 {Distributed Control by {L}agrangian Steepest Descent}, 
  note =	 {Available at \url{http://arxiv.org/abs/cs/0403012}}, 
  year =	 2004 
} 
@manual{WBPM+98, 
  author =	 {Whetten, B. and Basavaiah, M. and Paul, S. and 
                  Montgomery, T. and Rastogi, N. and Conlan, J. and 
                  Yeh, T.}, 
  title =	 {The {RMTP-II} Protocol, INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 Apr, 
  abstract =	 {TMTP introduce local NACK, global ACK. MFTP 
                  emphasize asymmetric link} 
} 
@InProceedings{WC01, 
  author =	 {Alec Woo and David Culler}, 
  title =	 {A Transmission Control Scheme for Media Access in 
                  Sensor Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {We study the problem of media access control in the 
                  novel regime of sensor networks, where unique 
                  application behavior and tight constraints in 
                  computation power, storage, energy resources, and 
                  radio technology have shaped this design space to be 
                  very different from that found in traditional mobile 
                  computing regime. Media access control in sensor 
                  networks must not only be energy efficient but 
                  should also allow fair bandwidth allocation to the 
                  infrastructure for all the nodes in a multihop 
                  network. We propose an adaptive rate control 
                  mechanism aiming to support these two goals and find 
                  that such a scheme is most effective in achieving 
                  our fairness goal while being energy efficient for 
                  both low and high duty cycle of network traffic.} 
} 
@TechReport{WC02, 
  author =	 {Alec Woo and David Culler}, 
  title =	 {Evaluation of Efficient Link Reliability Estimators 
                  for Low-Power Wireless Networks}, 
  institution =	 {UCB}, 
  year =	 2002, 
  month =	 Nov, 
  url =		 {\url{http://www.cs.berkeley.edu/~awoo/awooLinkTR.pdf}} 
} 
@InProceedings{WC03, 
  author =	 {A. Woo and D. Culler}, 
  title =	 {Taming the Underlying Challenges of Reliable 
                  Multihop Routing in Sensor Networks}, 
  crossref =	 {sensys03}, 
  year =	 2003 
} 
@InProceedings{WWZ01, 
  author =	 {Z. Wang and Y. Wang and L. Zhang}, 
  title =	 {Internet traffic engineering without full mesh 
                  overlaying}, 
  crossref =	 {infocom01}, 
  year =	 2001 
} 
@Article{WF83, 
  author =	 {C. Weinstein and J. W. Forgie}, 
  title =	 {Experience with Speech Communication in Packet 
                  Networks}, 
  journal =	 jsac, 
  volume =	 {6}, 
  number =	 {1}, 
  pages =	 {963--980}, 
  year =	 1983, 
  month =	 dec 
} 
@InProceedings{WGL98, 
  author =	 {Chung Kei Wong and Mohamed G. Gouda and Simon 
                  S. Lam}, 
  title =	 {Secure Group Communications Using Key Graphs}, 
  crossref =	 "sigcomm98", 
  abstract =	 {Key tree} 
} 
@InProceedings{WGT98, 
  author =	 {David J. Wetherall and John Guttag and David 
                  L. Tennenhouse}, 
  title =	 {{ANTS}: A Toolkit for Building and Dynamically 
                  Deploying Network Protocols}, 
  year =	 1998, 
  crossref =	 {openarch98}, 
  url = 
                  {\url{http://www.tns.lcs.mit.edu/publications/openarch98.html}} 
} 
@manual{WHA98, 
  author =	 {Wallner, D. and Harder, E. and Agee, Ryan}, 
  title =	 {Key Management for Multicast: Issues and 
                  Architectures, INTERNET-DRAFT}, 
  year =	 {1998}, 
  month =	 sep 
} 
@techreport{WHFG92, 
  author =	 "Roy Want and Andy Hopper and Veronica Falc{\~a}o and 
                  Jonathan Gibbons", 
  title =	 "The Active Badge Location System", 
  number =	 "92.1", 
  address =	 "24a Trumpington Street, Cambridge CB2 1QA", 
  institution =	 "Olivetti Research Ltd. ({ORL})", 
  year =	 1992, 
  annote =	 {mount on the ceiling}, 
  url =		 {} 
} 
@manual{WHK97, 
  author =	 {Mark Wahl and Tim Howes and Steve Kille}, 
  title =	 {Lightweight Directory Access Protocol (v3), {RFC} 
                  2251}, 
  month =	 dec, 
  year =	 1997, 
  abstract =	 {LDAP} 
} 
@Article{WJH97, 
  author =	 {A. Ward and A. Jones and A. Hopper}, 
  title =	 {A new location technique for the active office}, 
  journal =	 {{IEEE} Personal Communications}, 
  year =	 1997, 
  volume =	 4, 
  number =	 5, 
  pages =	 {42--47}, 
  abstract =	 {In this paper, we first present an overview of 
                  research into location-aware computing and evaluate 
                  currently available location sensor technologies. We 
                  then describe a new location sensor, tailored to 
                  provide information for context-sensitive computers, 
                  which has been developed at the Olivetti and Oracle 
                  Research Laboratory (ORL). Finally, we examine 
                  potential applications of this system in an Active 
                  Office [1] where location-aware equipment will be 
                  commonplace. Location-aware Computing ...}, 
  url =		 {} 
} 
@Article{WJWG+01, 
  author =	 {Min Wu and R.A. Joyce and Hau-San Wong and Long Guan 
                  and Sun-Yuan Kung}, 
  title =	 {Dynamic resource allocation via video content and 
                  short-term traffic statistics}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 2, 
  month =	 Jun, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19975/00923818.pdf?isNumber=19975}} 
} 
@Article{WL00:flowsigning, 
  author =	 {Chung Kei Wong and Simon S. Lam}, 
  title =	 {Digital Signatures for Flows and Multicasts}, 
  journal =	 ton, 
  year =	 1999, 
  month =	 Aug, 
  abstract =	 {Initial propose maxmin fairness} 
} 
@InProceedings{WL00:keystone, 
  title =	 {Keystone: a Group Key Management System}, 
  author =	 {Chung Kei Wong and Simon S. Lam}, 
  booktitle =	 {Proceedings of {ICT} 2000}, 
  year =	 2000, 
  month =	 May, 
  address =	 {Acapulco, Mexico} 
} 
@Article{WL98:sensor, 
  author =	 {J. Werb and C. Lanzl}, 
  title =	 {Designing a positioning system for finding things 
                  and people indoors}, 
  journal =	 {{IEEE} Spectrum}, 
  year =	 1998, 
  volume =	 35, 
  number =	 9, 
  pages =	 {71--78}, 
  month =	 Oct, 
  annote =	 {propose LPS, uses round-trip time to measure 
                  distance; The LPS subdivides the interior of the 
                  building into cell areas that vary in size with the 
                  desired level of coverage. The cells are each 
                  handled by a cell controller which is attached by a 
                  coaxial cable to up to 16 antennas.}, 
  url =		 {} 
} 
@InProceedings{WL98:sign, 
  author =	 {Chung Kei Wong and Simon S. Lam}, 
  title =	 {Digital Signatures for Flows and Multicasts}, 
  crossref =	 "icnp98", 
  abstract =	 {Tree signing} 
} 
@InProceedings{WLBW01, 
  author =	 {R. Wattenhofer and L. Li and P. Bahl and Y. Wang}, 
  title =	 {Distributed topology control for power efficient 
                  operation in multihop wireless ad hoc networks}, 
  crossref =	 "infocom01", 
  url = 
                  {} 
} 
@InProceedings{WNE02, 
  author =	 {Jeffrey E. Wieselthier and Gam Nguyen and Anthony 
                  Ephremides}, 
  title =	 {Energy-Limited Wireless Networking with Directional 
                  Antennas: The Case of Session-Based Multicasting}, 
  crossref =	 {infocom02}, 
  year =	 2002, 
  url =		 {\url{http://www.ieee-infocom.org/2002/papers/303.pdf}} 
} 
@InProceedings{WPS01, 
  author =	 {Victor Wen and Adrian Perrig and Robert Szewczyk}, 
  title =	 {{SPINS}: Security Suite for Sensor Networks}, 
  crossref =	 "mobicom01", 
  abstract =	 {As sensor networks edge closer towards wide-spread 
                  deployment, security issues become a central 
                  concern. So far, the main research focus has been on 
                  making sensor networks feasible and useful, and less 
                  emphasis was placed on security. We design a suite 
                  of security building blocks that are optimized for 
                  resource-constrained environments and wireless 
                  communication. SPINS has two secure building blocks: 
                  SNEP and uTesla. SNEP provides the following 
                  important baseline security primitives: Data 
                  confidentiality, two-party data authentication, and 
                  data freshness. A particularly hard problem is to 
                  provide efficient broadcast authentication, which is 
                  an important mechanism for sensor networks. uTesla 
                  is a new protocol which provides authenticated 
                  broadcast for severely resource-constrained 
                  environments. We implemented the above protocols, 
                  and show that they are practical even on 
                  minimalistic hardware: The performance of the 
                  protocol suite easily matches the data rate of our 
                  network. Additionally, we demonstrate that the suite 
                  can be used for building higher level protocols.} 
} 
@InProceedings{WS98, 
  author =	 {Wang, H. Amy and Schwartz, M.}, 
  title =	 {Achieving Bounded Fairness for Multicast Traffic and 
                  {TCP} Traffic in the {I}nternet}, 
  crossref =	 "sigcomm98", 
  abstract =	 {propose RLA: random listening algorithm} 
} 
@InProceedings{WTSW95, 
  title =	 {Self-Similarity Through High Variability: 
                  Statistical Analysis of {Ethernet} {LAN} Traffic at 
                  the Source Level}, 
  author =	 {W. Willinger and M. Taqqu and R. Sherman and 
                  D. Wilson}, 
  crossref =	 "sigcomm95", 
  abstract =	 {Self similar} 
} 
@Unpublished{WW03, 
  author =	 {Di Wu and Zhijun Wu}, 
  title =	 {An Updated Geometric Build-up Algorithm for 
                  Molecular Distance Geometry Problems with Sparse 
                  Distance Data}, 
  annote =	 {Available at: 
                  \url{http://www.math.iastate.edu/wu/updated.ps}}, 
  year =	 2003, 
  url =		 {\url{http://www.math.iastate.edu/wu/updated.ps}} 
} 
@InProceedings{WWDS94, 
  author =	 {Mark Weiser and Brent Welch and Alan Demers and 
                  Scott Shenker}, 
  title =	 {Scheduling for Reduced CPU Energy }, 
  crossref =	 "osdi94", 
  abstract =	 {The energy usage of computer systems is becoming 
                  more important, especially for battery operated 
                  systems. Displays, disks, and cpus, in that order, 
                  use the most energy. Reducing the energy used by 
                  displays and disks has been studied elsewhere; this 
                  paper considers a new method for reducing the energy 
                  used by the cpu. We introduce a new metric for cpu 
                  energy performance, 
                  millions-of-instructions-per-joule (MIPJ). We 
                  examine a class of methods to reduce MIPJ that are 
                  characterized by dynamic control of system clock 
                  speed by the operating system scheduler. Reducing 
                  clock speed alone does not reduce MIPJ, since to do 
                  the same work the system must run longer. However, a 
                  number of methods are available for reducing energy 
                  with reduced clock-speed, such as reducing the 
                  voltage [Chandrakasan et al 1992][Horowitz 1993] or 
                  using reversible [Younis and Knight 1993] or 
                  adiabatic logic [Athas et al 1994]. What are the 
                  right scheduling algorithms for taking advantage of 
                  reduced clock-speed, especially in the presence of 
                  applications demanding ever more 
                  instructions-per-second? We consider several methods 
                  for varying the clock speed dynamically under 
                  control of the operating system, and examine the 
                  performance of these methods against workstation 
                  traces. The primary result is that by adjusting the 
                  clock speed at a fine grain, substantial CPU energy 
                  can be saved with a limited impact on performance.}, 
  url = 
                  {\url{http://www.cs.utah.edu/~lepreau/osdi94/weiser/abstract.html}} 
} 
@Article{WWWM01, 
  author =	 {W.E. Walsh and M.P. Wellman and P.R. Wurman and 
                  J.K. MacKie-Mason}, 
  title =	 {Auction protocols for decentralized scheduling}, 
  journal =	 {Games and Economic Behavior}, 
  year =	 2001, 
  number =	 35, 
  pages =	 {271--303}, 
  url = 
                  {\url{http://ai.eecs.umich.edu/people/wellman/pubs/geb01wwwmm.pdf}} 
} 
@Article{WWYW01, 
  author =	 {Jhing-Fa Wang and Jia-Ching Wang and Jar-Ferr Yang 
                  and Jian-Jia Wang}, 
  title =	 {A voicing-driven packet loss recovery algorithm for 
                  analysis-by-synthesis predictive speech coders over 
                  Internet}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909597.pdf?isNumber=19626}} 
} 
@Article{War52, 
  author =	 {J. G. Wardrop}, 
  title =	 {Some theoretical aspects of road traffic research.}, 
  journal =	 {Proceedings of the INstitue of Civil Engineers, 
                  Pt. II}, 
  year =	 1952, 
  volume =	 1, 
  pages =	 {325--378} 
} 
@InProceedings{Wardrop52, 
  author =	 {J. G. Wardrop}, 
  title =	 {Some Theoretical Aspects of Road Traffic Research}, 
  booktitle =	 {Proceedings of the Institute of Civil Engineers, 
                  Part II}, 
  Volume =	 {1}, 
  pages =	 {325--378}, 
  year =	 "1952", 
} 
@Article{Wei93, 
  author =	 {M. Weiser}, 
  title =	 {Some Computer Science Problems in Ubiquitous 
                  Computing}, 
  journal =	 {Communications of {ACM}}, 
  year =	 1993, 
  month =	 Jul 
} 
@Book{Wei95, 
  author =	 {J. Weibull}, 
  title =	 {Evolutionary Game Theory}, 
  publisher =	 {{MIT} Press}, 
  year =	 1995, 
  address =	 {Cambridge, MA}, 
  annote =	 {Replica dynamics} 
} 
@article{Wel95, 
  author =	 "Gregory F. Welch", 
  title =	 "A Survey of Power Management Techniques in Mobile 
                  Computing Operating Systems", 
  journal =	 "Operating Systems Review", 
  volume =	 29, 
  number =	 4, 
  pages =	 "47--56", 
  year =	 1995, 
  url =		 {} 
} 
@InProceedings{Wet99, 
  author =	 {David J. Wetherall}, 
  title =	 {Active network vision and reality: lessons from a 
                  capsule-based system}, 
  crossref =	 {sosp99}, 
  year =	 1999, 
  url = 
                  {\url{http://www.cs.washington.edu/homes/djw/papers/anet-sosp99.pdf}} 
} 
@incollection{Whi96, 
  author =	 {W. Whiteley}, 
  title =	 {Some matroids from discrete applied geometry}, 
  booktitle =	 {Contemporary Mathematics}, 
  volume =	 197, 
  editor =	 {Joseph E. Bonin and James G. Oxley and Brigitte 
                  Servatius}, 
  publisher =	 {American Mathematical Society}, 
  year =	 1996, 
} 
@incollection{Whi97, 
  author =	 {W. Whiteley}, 
  title =	 {Rigidity and Scene Analysis}, 
  booktitle =	 {Handbook of Discrete and Computational Geometry}, 
  editor =	 {J. Goodman and J. O'Rourke}, 
  publisher =	 {CRC Press}, 
  pages =	 {893--916}, 
  year =	 1997, 
} 
@InProceedings{Wol63, 
  author =	 {J. Wolfowitz}, 
  title =	 {Product of Indecomposable, Aperiodic, Stochasic 
                  Matrices}, 
  booktitle =	 {Proceedings of {American} {Mathematical} {Society}}, 
  year =	 1963, 
  volume =	 15, 
  number =	 {733-737} 
} 
@manual{Wro97, 
  author =	 {J. Wroclawski}, 
  title =	 {Specification of controlled-load network element 
                  service, {RFC} 2211}, 
  month =	 Sep, 
  year =	 "1997", 
  url =		 {\url{http://andrew2.andrew.cmu.edu/rfc/rfc2211.html}} 
} 
@Unpublished{Wu03, 
  author =	 {Zhijun Wu}, 
  title =	 {A list of recent papers}, 
  annote =	 {Available at 
                  \url{http://www.math.iastate.edu/wu/page4.html}}, 
  url =		 {\url{http://www.math.iastate.edu/wu/page4.html}} 
} 
@Article{XHBN00, 
  author =	 {X. Xiao and A. Hannan and B. Bailey and L. Ni}, 
  title =	 {Traffic Engineering with {MPLS} in the {I}nternet}, 
  journal =	 {{IEEE} Network Magazine}, 
  year =	 2000, 
  pages =	 {28--33}, 
  month =	 Mar 
} 
@InProceedings{XHE01, 
  author =	 {Ya Xu and John Heidemann and Deborah Estrin}, 
  title =	 {Geography-informed Energy Conservation for Ad Hoc 
                  Routing}, 
  crossref =	 "mobicom01", 
  abstract =	 {We introduce a geographical adaptive fidelity(GAF) 
                  algorithm that reduces energy consumption in ad hoc 
                  wireless networks. GAF conserves energy by 
                  identifying nodes that are equivalent from a routing 
                  perspective and turning off unnecessary nodes, 
                  keeping a constant level of routing fidelity. GAF 
                  moderates this policy using application- and 
                  system-level information; nodes that source or sink 
                  data remain on and intermediate nodes monitor and 
                  balance energy use. GAF is independent of the 
                  underlying ad hoc routing protocol; we simulate GAF 
                  over unmodified AODV and DSR. Analysis and 
                  simulation studies of GAF show that it can consume 
                  40\% to 60\% less energy than an unmodified ad hoc 
                  routing protocol. Moreover, simulations of GAF 
                  suggest that network lifetime increases 
                  proportionally to node density; in one example, a 
                  four-fold increase in node density leads to network 
                  lifetime increase for 3 to 6 times (depending on the 
                  mobility pattern). More generally, GAF is an example 
                  of adaptive fidelity, a technique proposed for 
                  extending the lifetime of self-configuring systems 
                  by exploiting redundancy to conserve energy while 
                  maintaining application fidelity.} 
} 
@misc{XK02, 
  author =	 "Feng Xue and P. R. Kumar", 
  title =	 "The Number of Neighbors Needed for Connectivity of 
                  Wireless Networks", 
  month =	 Apr, 
  year =	 2002, 
  url =		 {} 
} 
@InProceedings{XP99, 
  author =	 {George Xylomenos and George C. Polyzos}, 
  title =	 {{TCP} and {UDP} Performance over a Wireless {LAN}}, 
  crossref =	 {infocom99}, 
  year =	 1999 
} 
@Unpublished{XQYZ04, 
  author =	 {H. Xie and L. Qiu and Y.R. Yang and Y. Zhang}, 
  title =	 {Achieving Traffic Equilibrium in Dynamic Networks}, 
  note =	 {Submitted}, 
  month =	 Feb, 
  year =	 2004 
} 
@InProceedings{FLMP+03, 
  author =	 {A. Fabrikant and A. Luthra and E. Maneva and 
                  C. Papadimitriou and S. Shenker}, 
  title =	 {On a Network Creation Game}, 
  crossref =	 {podc03}, 
  year =	 2003 
} 
@InProceedings{CFSK04, 
  author =	 {Byung-Gon Chun and Rodrigo Fonseca and Ion Stoica 
                  and John Kubiatowicz}, 
  title =	 {Characterizing Selfishly Constructed Overlay Routing 
                  Networks}, 
  crossref =	 {infocom04}, 
  url = 
                  {\url{http://www.ieee-infocom.org/2004/Papers/28_4.PDF}}, 
  annote =	 {The cost of a node is a function of the cost paid 
                  for links and the distances from the node to the 
                  other nodes. The strategy of a node, at a given 
                  time, is the choice that the node can make, i.e., 
                  the subset of the other nodes in the graph the node 
                  chooses to connect to. We start the game from a 
                  connected random graph, and in each round, each 
                  player changes its link configuration to minimize 
                  its cost. We employ two variants of this model in 
                  our simulations: an exhaustive search of the 
                  (exponential) strategy space, which can only 
                  feasibly be used in rather small topologies; for 
                  larger topologies we use a randomized local search 
                  strategy (drop a link if cost increase is below a 
                  threshold; add a link if above a threshold).} 
} 
@article{XSC03, 
  author =	 {Mingbo Xiao and Ness B. Shroff and Edwin 
                  K. P. Chong}, 
  title =	 {A utility-based power-control scheme in wireless 
                  cellular systems}, 
  journal =	 ton, 
  volume =	 11, 
  number =	 2, 
  year =	 2003, 
  pages =	 {210--221}, 
  doi =		 {http://doi.acm.org/10.1145/771516.771519}, 
  publisher =	 {ACM Press} 
} 
@InProceedings{YBM00, 
  author =	 {Jaehee Yoon and Azer Bestavros and Ibrahim Matta}, 
  title =	 {Adaptive Reliable Multicast}, 
  booktitle =	 {International Conference on Communications (ICC)}, 
  year =	 2000, 
  month =	 Jun, 
  address =	 {New Orleans, LA} 
} 
@TechReport{YGE01, 
  author =	 {Yan Yu and Ramesh Govindan and Deborah Estrin}, 
  title =	 {Geographical and Energy Aware Routing: A Recursive 
                  Data Dissemination Protocol for Wireless Sensor 
                  Networks}, 
  institution =	 {UCLA Computer Science Department}, 
  year =	 2001, 
  number =	 {UCLA/CSD-TR-01-0023}, 
  month =	 May, 
  url = 
                  {\url{http://www.parc.xerox.com/zhao/stanford-cs428/readings/Networking/Estrin_geo-routing01.pdf}} 
} 
@TechReport{YKL00binomialtech, 
  author =	 {Yang Richard Yang and Min Sik Kim and Simon S. Lam}, 
  title =	 {Analysis of {Binomial} Congestion Control}, 
  institution =	 utcs, 
  year =	 2000, 
  number =	 {TR--00--14}, 
  month =	 jun 
} 
@InProceedings{YKL00partition, 
  author =	 {Yang Richard Yang and Min Sik Kim and Simon S. Lam}, 
  title =	 {Optimal partitioning of multicast receivers}, 
  crossref =	 "icnp00", 
  abstract =	 {mine} 
} 
@TechReport{YKL00tech, 
  author =	 {Yang Richard Yang and Min Sik Kim and Simon S. Lam}, 
  title =	 {Transient behaviors of {TCP}-friendly congestion 
                  control protocols}, 
  institution =	 utcs, 
  address =	 {Austin, Texas, U.S.A.}, 
  year =	 2000, 
  number =	 {TR--00--23}, 
  month =	 sep 
} 
@InProceedings{YKL00transient, 
  author =	 {Yang Richard Yang and Min Sik Kim and Simon S. Lam}, 
  title =	 {Transient behaviors of {TCP}-friendly congestion 
                  control protocols}, 
  crossref =	 "infocom01", 
  abstract =	 {Mine} 
} 
@Article{YKSC01, 
  journal =	 itm, 
  title =	 {An adaptive redundancy control method for 
                  erasure-code-based real-time data transmission over 
                  the {I}nternet }, 
  author =	 {Seong-Won Yuk and Min-Gyu Kang and Byung-Cheol Shin 
                  and Dong-Ho Cho}, 
  year =	 2001, 
  volume =	 3, 
  number =	 3, 
  month =	 Sep, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/20438/00944479.pdf?isNumber=20438}} 
} 
@InProceedings{YKT96, 
  author =	 {Maya Yajnik and Jim Kurose and Don Towsley}, 
  title =	 {Packet Loss Correlation in the {MB}one Multicast 
                  Network}, 
  crossref =	 "gi96", 
  abstract =	 {first study, see Mark handley also} 
} 
@TechReport{YKZL00maimdtech, 
  author =	 {Yang Richard Yang and Min Sik Kim and Xincheng Zhang 
                  and Simon S. Lam}, 
  title =	 {Two Problems of {TCP} {AIMD} Congestion Control}, 
  institution =	 utcs, 
  year =	 2000, 
  number =	 {TR--00--13}, 
  month =	 jun 
} 
@InProceedings{YL00, 
  author =	 {Yang Richard Yang and Simon S. Lam}, 
  title =	 {General {AIMD} Congestion Control}, 
  crossref =	 "icnp00", 
  abstract =	 {mine} 
} 
@TechReport{YL00bound, 
  author =	 {Yang Richard Yang}, 
  title =	 {A Secure Group Key Management Communication Lower 
                  Bound}, 
  institution =	 utcs, 
  year =	 2000, 
  number =	 {TR--00--24}, 
  month =	 {July, Revised September} 
} 
@InProceedings{YL00mccc, 
  author =	 {Yang Richard Yang and Simon S. Lam}, 
  title =	 {{I}nternet Multicast Congestion Control}, 
  booktitle =	 {International Conference on Telecommunications 2000}, 
  year =	 2000, 
  address =	 {Mexico}, 
  month =	 May 
} 
@TechReport{YL00tech, 
  author =	 {Yang Richard Yang and Simon S. Lam}, 
  title =	 {General {AIMD} Congestion Control}, 
  institution =	 utcs, 
  address =	 {Austin, Texas, U.S.A.}, 
  year =	 2000, 
  number =	 {TR--00--09}, 
  month =	 May 
} 
@Article{YLL01, 
  author =	 {De-Nian Yang and Wanjiun Liao and Yen-Ting Lin}, 
  title =	 {{MQ}: an integrated mechanism for multimedia 
                  multicasting}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 1, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/19626/00909596.pdf?isNumber=19626}} 
} 
@InProceedings{YLN03, 
  author =	 {Jungkeun Yoon and Mingyan Liu and Brian Noble}, 
  title =	 {Sound Mobility Models}, 
  crossref =	 {mobicom03} 
} 
@InProceedings{YLW97, 
  author =	 {Yang Yang and Qingwen Liu and Zhixiang Wen}, 
  title =	 {Computational reflection being accommodation for 
                  semantic heterogeneity of multidatabases }, 
  booktitle =	 {IEEE International Conference on Intelligent 
                  Processing Systems}, 
  year =	 1997, 
  address =	 {Beijing, China}, 
  month =	 oct, 
  abstract =	 {The goal of a multidatabase system is to make 
                  component heterogeneity transparent to users and 
                  applications. The main problem of the integration of 
                  multiple databases lies in the semantic 
                  heterogeneity. We propose computational reflection 
                  which can to a great extent change a domain value's 
                  semantics according to the situation.} 
} 
@InProceedings{YLZ94, 
  author =	 {Yang Yang and Zhen Lu and Qixian Zhang}, 
  title =	 {Stiffness analysis of multi-fingered dextrous hands 
                  based on contact geometry and configuration change}, 
  booktitle =	 {IEEE International Conference on Industrial 
                  Technology '94}, 
  year =	 1994, 
  month =	 dec, 
  abstract =	 {We consider the contact geometry and the effect of 
                  grasp configuration change. On the grasp stiffness, 
                  this paper deals with the stiffness analysis both at 
                  the grasped object and the joint levels. Moreover, a 
                  set of formulas for computing stiffness in the 
                  hand-object system has been developed by means of 
                  introducing the additional stiffness induced from 
                  the grasp configuration change. An example of 
                  two-fingered hand with its grasped object is used to 
                  demonstrate the applicability of the 
                  method. Finally, the paper discusses the influence 
                  of the stiffness change on grasping stability.} 
} 
@TechReport{YLZL00, 
  author =	 {Yang Richard Yang and Xiaozhou Steve Li and Xincheng 
                  Brian Zhang and Simon S. Lam}, 
  title =	 {Towards Scalable and Reliable Group Key Management}, 
  institution =	 utcs, 
  year =	 2000, 
  number =	 {TR--00--26}, 
  month =	 nov 
} 
@InProceedings{YLZL01, 
  author =	 {Yang Richard Yang and Xiaozhou Steve Li and X. Brian 
                  Zhang and Simon S. Lam}, 
  title =	 {Reliable Group Rekeying: A Performance Analysis}, 
  crossref =	 "sigcomm01", 
  abstract =	 {keygem} 
} 
@TechReport{YLZL01tech, 
  author =	 {Yang Richard Yang and Xiaozhou Steve Li and Xincheng 
                  Brian Zhang and Simon S. Lam}, 
  title =	 {Reliable Group Rekeying: A Performance Analysis}, 
  institution =	 utcs, 
  year =	 2001, 
  number =	 {TR--01--21}, 
  month =	 jun 
} 
@InProceedings{YMKT99, 
  author =	 {Maya Yajnik and Sue Moon and Jim Kurose and Don 
                  Towsley}, 
  title =	 {Measurement and Modelling of the Temporal Dependence 
                  in Packet Loss}, 
  crossref =	 "infocom99", 
  abstract =	 {Loss} 
} 
@InProceedings{YNK02, 
  author =	 {Seung Yi and Prasad Naldurg and Robin Kravets}, 
  title =	 {A Security-Aware Routing Protocol for Wireless Ad 
                  Hoc Networks}, 
  booktitle =	 {SCI2002}, 
  year =	 2002, 
  url =		 {\url{http://www-sal.cs.uiuc.edu/~rhk/pubs/SCI2002.pdf}} 
} 
@Unpublished{YY98, 
  author =	 {Yang Yang}, 
  title =	 {Forward Error Correction}, 
  annote =	 {From PGM Appendix A}, 
  abstract =	 {Forward error correction for RM uses Reed Solomon 
                  Erasure code to correct packet-level transmission 
                  errors.This approach to Forward Error Correction 
                  (FEC) is based upon the computation of h parity 
                  packets from k data packets for a total of n packets 
                  such that a receiver can reconstruct the k data 
                  packets out of any k of the n packets. More 
                  specifically, it is characteristic of the parity 
                  packets that any x of them can be used to 
                  reconstruct any x of the original data packets. The 
                  original k data packets are referred to as the 
                  Transmission Group, and the total n packets as the 
                  FEC Block. These procedures permit any combination 
                  of pro-active FEC or on-demand FEC with conventional 
                  ARQ within a given TSI to provide any flavour of 
                  layered or integrated FEC. Pro-active FEC refers to 
                  the technique of computing parity packets at 
                  transmission time and transmitting them as a matter 
                  of course following the data packets. Pro-active FEC 
                  is recommended for providing loss recovery over 
                  simplex or asymmetric multicast channels over which 
                  returning retransmit requests is either impossible 
                  or costly. It provides increased reliability at the 
                  expense of bandwidth. On-demand FEC refers to the 
                  technique of computing parity packets at 
                  retransmission time and transmitting them only upon 
                  demand (i.e., receiver-based loss detection and 
                  retransmit request). On-demand FEC is recommended 
                  for providing loss recovery of uncorrelated loss in 
                  very large receiver populations in which the 
                  probability of any single packet being lost is 
                  substantial. It provides equivalent reliability to 
                  selective NAKs (ARQ) at the expense of no more and 
                  typically less bandwidth. Selective NAKs are NAKs 
                  that request the retransmission of specific packets 
                  by sequence number corresponding to the sequence 
                  number of any data packets detected to be missing 
                  from the expected sequence (conventional 
                  ARQ). Selective NAKs are recommended for recovering 
                  losses occurring in trailing partial transmission 
                  groups. Parity NAKs are NAKs that request the 
                  transmission of a specific number of parity packets 
                  by count corresponding to the count of the number of 
                  data packets detected to be missing from a group of 
                  k data packets (on-demand FEC) } 
} 
@Article{Yat95, 
  author =	 {Roy Yates}, 
  title =	 {A Framework for Uplink Power Control in Cellular 
                  Radio Systems}, 
  journal =	 jsac, 
  year =	 1995, 
  volume =	 13, 
  number =	 7, 
  pages =	 {1341--1348}, 
  month =	 Sep, 
  url =		 {\url{}} 
} 
@Article{ZB01, 
  author =	 {H. Zheng and J. Boyce}, 
  title =	 {An improved {UDP} protocol for video transmission 
                  over {I}nternet-to-wireless networks}, 
  journal =	 itm, 
  year =	 2001, 
  month =	 Sep, 
  volume =	 3, 
  number =	 3, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/20438/00944478.pdf?isNumber=20438}} 
} 
@InProceedings{ZCY03, 
  author =	 {Sheng Zhong and Jiang Chen and Yang Richard Yang}, 
  title =	 {Sprite, a simple, cheat-proof, credit-based system 
                  for mobile ad-hoc networks}, 
  crossref =	 "infocom03" 
} 
@Article{ZDES+93, 
  author =	 "L. Zhang and S.E. Deering and D. Estrin and 
                  S. Shenker and D. Zappala", 
  title =	 "{RSVP: A new resource ReSerVation Protocol}", 
  journal =	 inm, 
  volume =	 {9}, 
  number =	 {5}, 
  year =	 {1993}, 
  abstract =	 {Describe RSVP, the signalling protocol for IntServ.}, 
  url =		 {ftp://parcftp.xerox.com/pub/net-research/rsvp.ps.Z} 
} 
@InProceedings{SARK02, 
  author =	 {L. Subramanian and S. Agarwal and J. Rexford and 
                  R. H. Katz}, 
  title =	 {Characterizing the {I}nternet Hierarchy from 
                  Multiple Vantage Points}, 
  crossref =	 {infocom02} 
} 
@Article{GR01, 
  author =	 {L. Gao and J. Rexford}, 
  title =	 {Stable {I}nternet Routing Without Global 
                  Coordination}, 
  journal =	 ton, 
  volume =	 9, 
  number =	 6, 
  year =	 2001, 
  month =	 Dec, 
  issn =	 {1063-6692}, 
  pages =	 {681--692}, 
  doi =		 {http://doi.acm.org/10.1145/504611.504612}, 
} 
@InProceedings{GW02, 
  author =	 {Lixin Gao and Feng Wang}, 
  title =	 {The Extent of {AS} Path Inflation by Routing 
                  Policies}, 
  booktitle =	 {Proceedings of Global {I}nternet}, 
  year =	 2002, 
  url = 
                  {\url{http://www-unix.ecs.umass.edu/~lgao/globalinternet2002_feng.pdf}} 
} 
@InProceedings{WG03, 
  author =	 {F. Wang and L. Gao}, 
  title =	 {Inferring and Characterizing {I}nternet Routing 
                  Policies}, 
  crossref =	 {imc03}, 
  url = 
                  {\url{http://rio.ecs.umass.edu/~gao/paper/imc_final.pdf}} 
} 
@InProceedings{GW00, 
  author =	 {Timothy G. Griffin and Gordon Wilfong}, 
  title =	 {A Safe Path Vector Protocol}, 
  crossref =	 {infocom00}, 
  url =		 {\url{http://www.ieee-infocom.org/2000/papers/99.ps}} 
} 
@InProceedings{GGR01, 
  author =	 {Lixin Gao and Timothy G. Griffin and Jennifer 
                  Rexford}, 
  title =	 {Inherently Safe Backup Routing with {BGP}}, 
  crossref =	 {infocom01}, 
  url =		 {\url{http://www.ieee-infocom.org/2001/paper/573.ps}} 
} 
@Article{GSW02, 
  author =	 {Timothy G. Griffin and F. Bruce Shepherd and Gordon 
                  Wilfong}, 
  title =	 {The Stable Paths Problem and Interdomain Routing}, 
  journal =	 ton, 
  year =	 2002, 
  volume =	 10, 
  number =	 22, 
  pages =	 {232--243}, 
  month =	 Apr, 
  url = 
                  {\url{http://portal.acm.org/citation.cfm?id=508332&jmp=cit&dl=portal&dl=ACM}} 
} 
@InProceedings{FBR04, 
  author =	 {Nick Feamster and Hari Balakrishnan and Jennifer 
                  Rexford}, 
  title =	 {Some Foundational Problems in Interdomain Routing}, 
  crossref =	 {hotnets04}, 
  url = 
                  {\url{http://ramp.ucsd.edu/conferences/HotNets-III/HotNets-III~Proceedings/camera.pdf}} 
} 
@InProceedings{FJB05, 
  author =	 {Nick Feamster and Ramesh Johari and Hari Balakrishnan}, 
  title =	 {Implications of Autonomy for the Expressiveness of Policy Routing}, 
  year =	 2005, 
  crossref =	 {sigcomm05} 
} 
@InProceedings{JR04, 
  author =	 {A.D. Jaggard and V. Ramachandran}, 
  title =	 {Robustness of Class-Based Path-Vector Systems}, 
  crossref =	 {icnp04}, 
  url = 
                  {\url{http://cs-www.cs.yale.edu/homes/vijayr/papers/classbased.pdf}} 
} 
@InProceedings{JR05, 
  author =	 {A.D. Jaggard and V. Ramachandran}, 
  title =	 {Relating Two Formal Models of Path-Vector Routing}, 
  crossref =	 {infocom05}, 
  url = 
                  {\url{http://cs-www.cs.yale.edu/homes/vijayr/papers/algequiv.pdf}} 
} 
@InProceedings{Sob03, 
  author =	 {Joao Luis Sobrinho}, 
  title =	 {Network Routing with Path Vector Protocols: Theory 
                  and Applications}, 
  crossref =	 {sigcomm03}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm2003/papers/p49-sobrinho.pdf}} 
} 
@InProceedings{GJR03, 
  author =	 {Timothy G. Griffin and Aaron D. Jaggard and Vijay 
                  Ramachandran}, 
  title =	 {Design Principles of Policy Languages for Path 
                  Vector Protocols}, 
  crossref =	 {sigcomm03}, 
  url = 
                  {\url{http://www.acm.org/sigs/sigcomm/sigcomm2003/papers.html#p61-griffin}} 
} 
@InProceedings{BPP03, 
  author =	 {Giuseppe Di Battista and Maurizio Patrignani and 
                  Maurizio Pizzonia}, 
  title =	 {Computing the Types of the Relationships between 
                  Autonomous Systems}, 
  crossref =	 {infocom03}, 
  url = 
                  {\url{http://www.ieee-infocom.org/2003/papers/04_04.PDF}} 
} 
@Article{Gao01, 
  author =	 {Lixin Gao}, 
  title =	 {On Inferring Autonomous System Relationships in the 
                  {I}nternet}, 
  journal =	 ton, 
  year =	 2001, 
  volume =	 9, 
  number =	 6, 
  month =	 Dec 
} 
@InProceedings{ZDGH00, 
  author =	 {Zhi-Li Zhang and Zhenhai Duan and Lixin Gao and 
                  Yiwei Thomas Hou}, 
  title =	 {Decoupling QoS control from core routers: a novel 
                  bandwidth broker architecture for scalable support 
                  of guaranteed service}, 
  crossref =	 "sigcomm00", 
  abstract =	 {} 
} 
@InProceedings{ZDPS01, 
  author =	 {Yin Zhang and Nick Duffield and Vern Paxson and 
                  Scott Shenker}, 
  title =	 {On the Constancy of {I}nternet Path Properties}, 
  crossref =	 "imc01", 
  year =	 2001, 
  url = {\url{http://www.icir.org/vern/imw-2001/imw2001-papers/38.pdf}}, 
  abstract =	 {Many Internet protocols and operational procedures 
                  use measurements to guide future actions. This is an 
                  effective strategy if the quantities being measured 
                  exhibit a degree of constancy: that is, in some 
                  fundamental sense, they are not changing. In this 
                  paper we explore three different notions of 
                  constancy: mathematical, operational, and 
                  predictive. Using a large measurement dataset 
                  gathered from the NIMI infrastructure, we then apply 
                  these notions to three Internet path properties: 
                  loss, delay, and throughput. Our aim is to provide 
                  guidance as to when assumptions of various forms of 
                  constancy are sound, versus when they might prove 
                  misleading.}, 
 
  annote =	 {The main conclusion is that delay is relatively easy 
                  to predict -- regardless of the delay predictors 
                  being used, one can achieve similar low prediction 
                  error (~22\%). Note that we were using one-step 
                  forecasting (i.e. using the history to predict next 
                  RTT value, instead of using today's RTT to predict 
                  tomorrow's RTT).} 
} 
@Misc{ZFH99, 
  author =	 {Thomas Ziegler and Serge Fdida and Ulrich Hofmann}, 
  title =	 {Red+ Gateways For Identification And Discrimination 
                  Of Unfriendly Best-Effort Flows In The {I}nternet}, 
  year =	 1999, 
  url =		 {} 
} 
@InProceedings{ZG03, 
  author =	 {Jerry Zhao and Ramesh Govindan}, 
  title =	 {Understanding Packet Delivery Performance In Dense 
                  Wireless Sensor Networks}, 
  crossref =	 {sensys03}, 
  year =	 2003 
} 
@Article{ZH99, 
  author =	 {Lidong Zhou and Zygmunt J. Haas}, 
  title =	 {Securing Ad Hoc Networks}, 
  journal =	 {{IEEE} Network Magazine}, 
  year =	 1999, 
  url = 
                  {} 
} 
@InProceedings{ZJ01, 
  author =	 {Ali Nabi Zadeh and Bijan Jabbari}, 
  title =	 {A High Capacity Multihop Packet {CDMA} Wireless 
                  Network}, 
  crossref =	 "mobicom01", 
  abstract =	 {} 
} 
@InProceedings{ZL00, 
  author =	 {Yongguang Zhang and Wenke Lee}, 
  title =	 {Intrusion Detection for Wireless Ad-Hoc Networks }, 
  crossref =	 "mobicom00", 
  abstract =	 {As the recent denial-of-service attacks on several 
                  major Internet sites have shown us, no open computer 
                  network is immune from intrusions. Wireless ad hoc 
                  network is particularly vulnerable due to its nature 
                  of open medium, dynamic changing topology, 
                  cooperative algorithms, lack of centralized 
                  monitoring and management point, and lack of a clear 
                  line of defense. Many of the intrusion detection 
                  techniques developed on a fixed wired network are 
                  not applicable in this new environment. It is a 
                  challenging research problem on how to do it 
                  differently and effectively. In this paper, we 
                  explain what are the vulnerabilities of a wireless 
                  ad hoc network, why we need intrusion detection, why 
                  the current methods cannot apply directly, and what 
                  are the possible mechanisms for intrusion detection 
                  and response in wireless ad hoc network. } 
} 
@Article{ZLLG+03, 
  author =	 {F. Zhao and J. Liu and J. Liu and L. Guibas and 
                  J. Reich}, 
  title =	 {Collaborative Signal and Information Processing: An 
                  Information Directed Approach}, 
  journal =	 {Proceedings of the {IEEE}}, 
  year =	 2003, 
  volume =	 91, 
  number =	 8, 
  pages =	 {1199--1209}, 
  url =		 {\url{http://www.parc.com/cosense/pub/ieee-sn.pdf}} 
} 
@InProceedings{FBRS+04, 
  author =	 {Nick Feamster and Hari Balakrishnan and Jennifer 
                  Rexford and Aman Shaikh and Kobus van der Merwe}, 
  title =	 {The Case for Separating Routing from Routers}, 
  crossref =	 {fdna04}, 
  year =	 2004 
} 
@InProceedings{ZLLY01, 
  author =	 {X. Brian Zhang and Simon S. Lam and Dong-Young Lee 
                  and Yang Richard Yang}, 
  title =	 {Protocol Design for Scalable and Reliable Group 
                  Rekeying}, 
  booktitle =	 {Proceedings of {SPIE} Conference on Scalability and 
                  Traffic Control in IP Networks}, 
  year =	 2001, 
  month =	 Aug, 
  address =	 {Denver, CO} 
} 
@TechReport{ZLLY04, 
  author =	 {S. Zhong and L. Li and Y. Liu and Y. R. Yang}, 
  title =	 {On Designing Incentive-Compatible Routing and 
                  Forwarding Protocols in Wireless Ad-Hoc Networks --- 
                  an Integrated Approach Using Game Theoretical and 
                  Cryptographic Techniques}, 
  institution =	 {Yale University Computer Science Department}, 
  year =	 2004, 
  number =	 {YALEU/DCS/TR-1286}, 
  month =	 Mar 
} 
@InProceedings{ZMM99, 
  author =	 {Giorgos Zacharia and Alexandros Moukas and Pattie 
                  Maes}, 
  title =	 {Collaborative Reputation Mechanisms in Electronic 
                  Marketplaces}, 
  booktitle =	 {Proceedings of the 32nd {H}awaii International 
                  Conference on System Sciences}, 
  year =	 1999, 
  url =		 {} 
} 
@InProceedings{ZNA03, 
  author =	 {Moshe Zukerman and Timothy D. Neame and Ronald 
                  G. Addie}, 
  title =	 {Internet Traffic Modeling and Future Technology 
                  Implications}, 
  crossref =	 {infocom03}, 
  year =	 2003, 
  url =		 {\url{http://www.ieee-infocom.org/2003/papers/15_01.PDF}}, 
  abstract =	 {This paper presents the Poisson Pareto burst process 
                  (PPBP) as a simple but accurate model for Internet 
                  traffic. It presents formulae relating the 
                  parameters of the PPBP to measurable traffic 
                  statistics, and describes a technique for fitting 
                  the PPBP to a given traffic stream. The PPBP is 
                  shown to accurately predict the queueing performance 
                  of a sample trace of aggregated Internet traffic. We 
                  predict that in few years, natural growth and 
                  statistical multiplexing will lead to an efficient 
                  optical Internet.} 
} 
@TechReport{ZPS00, 
  author =	 {Yin Zhang and Vern Paxson and Scott Shenker}, 
  title =	 {The Stationarity of {I}nternet Path Properties: 
                  Routing, Loss, and Throughput}, 
  institution =	 {ACIRI}, 
  year =	 2000, 
  month =	 May, 
  abstract =	 {\url{http://www.aciri.org/vern/papers.html}} 
} 
@InProceedings{ZPWK02, 
  author =	 {M. Zhang and L. Peterson and R. Wang and 
                  A. Krishnamurthy}, 
  title =	 {Probabilistic Packet Scheduling: Achieving 
                  Proportional Share Bandwidth Allocation}, 
  crossref =	 "infocom02" 
} 
@InProceedings{ZSC91, 
  author =	 {L. Zhang and S. Shenker and D.D. Clark}, 
  title =	 {Observations on the Dynamics of a Congestion Control 
                  Algorithm: The Effects of Two-Way Traffic}, 
  crossref =	 "sigcomm91", 
  url =		 {} 
} 
@InProceedings{ZSSK99, 
  author =	 {X. Zhang K. Shin and D. Saha and D. Kandlur}, 
  title =	 {Scalable flow control for multicast {ABR} services}, 
  crossref =	 "infocom99", 
  abstract =	 {ATM} 
} 
@InProceedings{ZY02, 
  author =	 {Jie (Jay) Zhou and Yang Richard Yang}, 
  title =	 {{PARCelS}: Pervasive ad-hoc Relaying for Cellular 
                  Systems}, 
  booktitle =	 {{Med-Hoc-Net} Workshop}, 
  year =	 2002, 
  address =	 {Sardegna, Italy}, 
  month =	 Sep 
} 
@InProceedings{ZY02:mobilesec, 
  author =	 {Sheng Zhong and Yang Richard Yang}, 
  title =	 {Verifiable Distributed Oblivious Transfer and Mobile 
                  Agent Security}, 
  crossref =	 "pomc03", 
  year =	 2003 
} 
@Article{ZZZ01, 
  author =	 {Qian Zhang and Wenwu Zhu and Ya-Qin Zhang}, 
  title =	 {Resource allocation for multimedia streaming over 
                  the {I}nternet}, 
  journal =	 itm, 
  year =	 2001, 
  volume =	 3, 
  number =	 3, 
  month =	 Sep, 
  url = 
                  {\url{http://ieeexplore.ieee.org/iel5/6046/20438/00944477.pdf?isNumber=20438}} 
} 
@MastersThesis{Zac99, 
  author =	 {Giorgos Zacharia}, 
  title =	 {Collaborative Reputation Mechanisms in Online 
                  Communities}, 
  school =	 {Massachusetts Institue of Technologys}, 
  year =	 {1999}, 
} 
@InProceedings{Zha90, 
  author =	 {L. Zhang}, 
  title =	 {Virtual clock: a new traffic control algorithm for 
                  packet switching networks}, 
  crossref =	 "sigcomm90", 
  abstract =	 {Virtual clock}, 
  url =		 {} 
} 
@Article{Zim80, 
  author =	 {H. Zimmerman}, 
  title =	 {{OSI} Reference Model -- The {ISO} Model of 
                  Architecture for Open Systems Interconnection}, 
  journal =	 toc, 
  volume =	 {28}, 
  number =	 {4}, 
  month =	 Apr, 
  year =	 1980, 
  pages =	 {425--432}, 
  abstract =	 {Review of the ISO/OSI seven layer model.}, 
  url =		 {} 
} 
@Book{Zim94, 
  author =	 {P. Zimmermann}, 
  title =	 {{PGP} User's Guide}, 
  publisher =	 {{MIT} Press}, 
  year =	 1994, 
  address =	 {Cambridge, MA} 
} 
@Proceedings{algosensors04, 
  title =	 {Proceedings of First International Workshop on 
                  Algorithmic Aspects of Wireless Sensor Networks}, 
  booktitle =	 {Proceedings of First International Workshop on 
                  Algorithmic Aspects of Wireless Sensor Networks}, 
  address =      {Turku, Finland}, 
  month =        Jul, 
  year =	 "2004", 
} 
@Misc{ciscoAironet, 
  key =		 {Aironet}, 
  author =	 {{Cisco Systems Inc}}, 
  title =	 {Data Sheet for Cisco Aironet}, 
  year =	 2004 
} 
@Proceedings{ec00, 
  title =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'00})}, 
  booktitle =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'00})}, 
  month =	 Oct, 
  year =	 2000, 
  address =	 {Minneapolis, MN}, 
  key =		 {EC 2000}, 
  url =		 {\url{http://www.research.ibm.com/iac/ec00/}} 
} 
@Proceedings{ec01, 
  title =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'01})}, 
  booktitle =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'01})}, 
  month =	 Oct, 
  year =	 2001, 
  address =	 {Tampa, FL}, 
  key =		 {EC 2001}, 
  url =		 {\url{http://www.acm.org/sigecom/EC01/}} 
} 
@Proceedings{ec02, 
  title =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'02})}, 
  booktitle =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'02})}, 
  month =	 Oct, 
  year =	 2002, 
  address =	 {}, 
  key =		 {EC 2002}, 
  url =		 {\url{http://www.acm.org/sigecom/EC02/}} 
} 
@Proceedings{ec03, 
  title =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'03})}, 
  booktitle =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'03})}, 
  month =	 Jun, 
  year =	 2003, 
  address =	 {San Diego, CA}, 
  key =		 {EC 2003}, 
  url =		 {\url{http://www.acm.org/sigecom/EC03/}} 
} 
@Proceedings{ec04, 
  title =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'04})}, 
  booktitle =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'04})}, 
  month =	 Oct, 
  year =	 2004, 
  address =	 {}, 
  key =		 {EC 2004}, 
  url =		 {\url{http://www.acm.org/sigecom/EC04/}} 
} 
@Proceedings{ec05, 
  title =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'05})}, 
  booktitle =	 {Proceedings of the ACM Symposium on Electronic 
                  Commerce ({EC'05})}, 
  month =	 Oct, 
  year =	 2005, 
  address =	 {}, 
  key =		 {EC 2005}, 
  url =		 {\url{http://www.acm.org/sigecom/EC05/}} 
} 
@Proceedings{focs00, 
  title =	 "Proceedings of the 41st Annual Symposium on 
                  Foudations of Computer Science", 
  booktitle =	 "Proceedings of the 41st Annual Symposium on 
                  Foudations of Computer Science", 
  address =	 {Redondo Beach, CA }, 
  month =	 Nov, 
  year =	 2000, 
  key =		 {FOCS 2000}, 
  url =		 {\url{http://www-2.cs.cmu.edu/~FOCS2000/}} 
} 
@Proceedings{focs01, 
  title =	 "Proceedings of the 42nd Annual Symposium on 
                  Foudations of Computer Science", 
  booktitle =	 "Proceedings of the 42nd Annual Symposium on 
                  Foudations of Computer Science", 
  address =	 {Las Vegas, Nevada}, 
  month =	 Oct, 
  year =	 2001, 
  key =		 {FOCS 2001}, 
  url =		 {\url{http://theory.stanford.edu/focs2001/}} 
} 
@Proceedings{focs02, 
  title =	 "Proceedings of the 43rd Annual Symposium on 
                  Foudations of Computer Science", 
  booktitle =	 "Proceedings of the 43rd Annual Symposium on 
                  Foudations of Computer Science", 
  address =	 {}, 
  month =	 Oct, 
  year =	 2002, 
  key =		 {FOCS 2002}, 
  url =		 {} 
} 
@Proceedings{focs03, 
  title =	 "Proceedings of the 44th Annual Symposium on 
                  Foudations of Computer Science", 
  booktitle =	 "Proceedings of the 44th Annual Symposium on 
                  Foudations of Computer Science", 
  address =	 {}, 
  month =	 Oct, 
  year =	 2003, 
  key =		 {FOCS 2003}, 
  url =		 {} 
} 
@Proceedings{focs04, 
  title =	 "Proceedings of the 45th Annual Symposium on 
                  Foudations of Computer Science", 
  booktitle =	 "Proceedings of the 45th Annual Symposium on 
                  Foudations of Computer Science", 
  address =	 {}, 
  month =	 Oct, 
  year =	 2004, 
  key =		 {FOCS 2004}, 
  url =		 {} 
} 
@Proceedings{focs05, 
  title =	 "Proceedings of the 46th Annual Symposium on 
                  Foudations of Computer Science", 
  booktitle =	 "Proceedings of the 46th Annual Symposium on 
                  Foudations of Computer Science", 
  address =	 {}, 
  month =	 Oct, 
  year =	 2005, 
  key =		 {FOCS 2005}, 
  url =		 {} 
} 
@Misc{geopriv, 
  key =		 {Geographic Location/Privacy (geopriv) Group}, 
  title =	 {Geographic Location/Privacy (geopriv) Group}, 
  howpublished = 
                  {\url{http://www.ietf.org/html.charters/geopriv-charter.html}}, 
  annote =	 {location} 
} 
@Proceedings{gi96, 
  title =	 "Proceedings of IEEE Global Internet '96", 
  booktitle =	 "Proceedings of IEEE Global Internet '96", 
  address =	 {}, 
  month =	 Nov, 
  key =		 {GI 1996}, 
  year =	 1996 
} 
@Proceedings{globecom00, 
  title =	 "Proceedings of IEEE GLOBECOM '00", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '00", 
  address =	 {}, 
  month =	 Nov, 
  year =	 2000, 
  key =		 {Globecom 2000}, 
  url =		 {} 
} 
@Proceedings{globecom01, 
  title =	 "Proceedings of IEEE GLOBECOM '01", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '01", 
  address =	 {San Antonio, TX}, 
  month =	 Nov, 
  year =	 2001, 
  key =		 {Globecom 2001}, 
  url =		 {\url{http://www.globecom2001.com/src/CallForPapers.shtml}} 
} 
@Proceedings{globecom02, 
  title =	 "Proceedings of IEEE GLOBECOM '02", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '02", 
  address =	 {Taipei, Taiwan}, 
  month =	 Nov, 
  year =	 2002, 
  key =		 {Globecom 2002}, 
  url =		 {\url{http://www.globecom2002.com/}} 
} 
@Proceedings{globecom03, 
  title =	 "Proceedings of IEEE GLOBECOM '03", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '03", 
  address =	 {}, 
  month =	 Nov, 
  year =	 2003, 
  key =		 {Globecom 2003}, 
  url =		 {} 
} 
@Proceedings{globecom04, 
  title =	 "Proceedings of IEEE GLOBECOM '04", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '04", 
  address =	 {}, 
  month =	 Nov, 
  year =	 2004, 
  key =		 {Globecom 2004}, 
  url =		 {} 
} 
@Proceedings{globecom05, 
  title =	 "Proceedings of IEEE GLOBECOM '05", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '05", 
  address =	 {}, 
  month =	 Nov, 
  year =	 2005, 
  key =		 {Globecom 2005}, 
  url =		 {} 
} 
@Proceedings{globecom83, 
  title =	 "Proceedings of IEEE GLOBECOM '83", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '83", 
  address =	 {San Diego, CA}, 
  month =	 Nov, 
  key =		 {Globecom 1983}, 
  year =	 1983 
} 
@Proceedings{globecom95, 
  title =	 "Proceedings of IEEE GLOBECOM '95", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '95", 
  address =	 {Singapore}, 
  month =	 Nov, 
  key =		 {Globecom 1995}, 
  year =	 1995 
} 
@Proceedings{globecom96, 
  title =	 "Proceedings of IEEE GLOBECOM '96", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '96", 
  address =	 {}, 
  month =	 Nov, 
  key =		 {Globecom 1996}, 
  year =	 1996 
} 
@Proceedings{globecom97, 
  title =	 "Proceedings of IEEE GLOBECOM '97", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '97", 
  address =	 {}, 
  month =	 Nov, 
  key =		 {Globecom 1997}, 
  year =	 1997 
} 
@Proceedings{globecom98, 
  title =	 "Proceedings of IEEE GLOBECOM '98", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '98", 
  address =	 {}, 
  month =	 Nov, 
  key =		 {Globecom 1998}, 
  year =	 1998 
} 
@Proceedings{globecom99, 
  title =	 "Proceedings of IEEE GLOBECOM '99", 
  booktitle =	 "Proceedings of IEEE GLOBECOM '99", 
  address =	 {}, 
  month =	 Nov, 
  key =		 {Globecom 1999}, 
  year =	 1999 
} 
@Misc{glomosim, 
  key =		 "GloMoSim", 
  title =	 {{GloMoSim}}, 
  howpublished = {\url{http://pcl.cs.ucla.edu/projects/glomosim/}} 
} 
@Proceedings{hpdc96, 
  title =	 "Proceedings of High Performance Distributed 
                  Computing Focus Workshop (HPDC '96)", 
  booktitle =	 "Proceedings of High Performance Distributed 
                  Computing Focus Workshop (HPDC '96)", 
  address =	 {Syracuse, New York}, 
  month =	 Aug, 
  key =		 {HDPC 1996}, 
  year =	 1996 
} 
@Proceedings{icccn00, 
  title =	 {Proceedings of the 9th International Conference on 
                  Computer Communications and Networks ({IC3N})}, 
  booktitle =	 {Proceedings of the 9th International Conference on 
                  Computer Communications and Networks ({IC3N})}, 
  address =	 {Las Vegas, NV}, 
  month =	 Oct, 
  year =	 2000, 
  key =		 {ICCCN 2000}, 
  url =		 {\url{http://icccn.cstp.umkc.edu/icccn00/2000.html}} 
} 
@Proceedings{icccn01, 
  title =	 {Proceedings of the 10th International Conference on 
                  Computer Communications and Networks}, 
  booktitle =	 {Proceedings of the 10th International Conference on 
                  Computer Communications and Networks}, 
  address =	 {Phoenix, AZ}, 
  month =	 Oct, 
  year =	 2001, 
  key =		 {ICCCN 2001}, 
  url =		 {\url{http://icccn.cstp.umkc.edu/}} 
} 
@Proceedings{icccn02, 
  title =	 {Proceedings of the 11th International Conference on 
                  Computer Communications and Networks}, 
  booktitle =	 {Proceedings of the 11th International Conference on 
                  Computer Communications and Networks}, 
  address =	 {Miami, FL}, 
  month =	 Oct, 
  year =	 2002, 
  key =		 {ICCCN 2002}, 
  url =		 {\url{http://icccn.cstp.umkc.edu/}} 
} 
@Proceedings{icccn95, 
  title =	 {Proceedings of the International Conference on 
                  Computer Communications and Networks ({IC3N})}, 
  booktitle =	 {Proceedings of the International Conference on 
                  Computer Communications and Networks ({IC3N})}, 
  address =	 {Las Vegas, NV}, 
  month =	 Sep, 
  key =		 {ICCCN 1995}, 
  year =	 1995 
} 
@Proceedings{icnp00, 
  title =	 "Proceedings of the 8th International Conference on 
                  Network Protocols ({ICNP}) '00", 
  booktitle =	 "Proceedings of the 8th International Conference on 
                  Network Protocols ({ICNP}) '00", 
  address =	 {Osaka, Japan}, 
  month =	 Nov, 
  year =	 2000, 
  key =		 {ICNP 2000}, 
  url =		 {\url{http://supernova.nal.ics.es.osaka-u.ac.jp/icnp2000/}} 
} 
@Proceedings{icnp01, 
  title =	 "Proceedings of the 9th International Conference on 
                  Network Protocols ({ICNP}) '01", 
  booktitle =	 "Proceedings of the 9th International Conference on 
                  Network Protocols ({ICNP}) '01", 
  address =	 {Riverside, CA}, 
  month =	 Oct, 
  year =	 2001, 
  key =		 {ICNP 2001}, 
  url =		 {\url{http://www.cis.udel.edu/icnp2001/}} 
} 
@Proceedings{icnp02, 
  title =	 "Proceedings of the 10th International Conference on 
                  Network Protocols ({ICNP}) '02", 
  booktitle =	 "Proceedings of the 10th International Conference on 
                  Network Protocols ({ICNP}) '02", 
  address =	 {Paris, France}, 
  month =	 Oct, 
  key =		 {ICNP 2002}, 
  year =	 2002 
} 
@Proceedings{icnp03, 
  title =	 "Proceedings of the 11th International Conference on 
                  Network Protocols ({ICNP}) '03", 
  booktitle =	 "Proceedings of the 11th International Conference on 
                  Network Protocols ({ICNP}) '03", 
  address =	 {Atlanta, Georgia}, 
  month =	 Nov, 
  key =		 {ICNP 2003}, 
  year =	 2003 
} 
@Proceedings{icnp04, 
  title =	 "Proceedings of the 12nd International Conference on 
                  Network Protocols ({ICNP}) '04", 
  booktitle =	 "Proceedings of the 12nd International Conference on 
                  Network Protocols ({ICNP}) '04", 
  address =	 {Berlin, Germany}, 
  month =	 Oct, 
  key =		 {ICNP 2004}, 
  year =	 2004 
} 
@Proceedings{icnp05, 
  title =	 "Proceedings of the 13th International Conference on 
                  Network Protocols ({ICNP}) '05", 
  booktitle =	 "Proceedings of the 13th International Conference on 
                  Network Protocols ({ICNP}) '05", 
  address =	 {Boston, MA}, 
  month =	 Nov, 
  key =		 {ICNP 2005}, 
  year =	 2005 
} 
@Proceedings{icnp06, 
  title =	 "Proceedings of the 14th International Conference on 
                  Network Protocols ({ICNP})", 
  booktitle =	 "Proceedings of the 14th International Conference on 
                  Network Protocols ({ICNP})", 
  address =	 {}, 
  month =	 Nov, 
  key =		 {ICNP 2006}, 
  year =	 2006 
} 
@Proceedings{icnp93, 
  title =	 "Proceedings of the 1st International Conference on 
                  Network Protocols ({ICNP}) '93", 
  booktitle =	 "Proceedings of the 1st International Conference on 
                  Network Protocols ({ICNP}) '93", 
  address =	 {}, 
  month =	 Oct, 
  key =		 {ICNP 1993}, 
  year =	 1993 
} 
@Proceedings{icnp94, 
  title =	 "Proceedings of the 2nd International Conference on 
                  Network Protocols ({ICNP}) '94", 
  booktitle =	 "Proceedings of the 2nd International Conference on 
                  Network Protocols ({ICNP}) '94", 
  address =	 {Boston, MA}, 
  month =	 Oct, 
  key =		 {ICNP 1994}, 
  year =	 1994 
} 
@Proceedings{icnp95, 
  title =	 "Proceedings of the 3rd International Conference on 
                  Network Protocols ({ICNP}) '95", 
  booktitle =	 "Proceedings of the 3rd International Conference on 
                  Network Protocols ({ICNP}) '95", 
  address =	 {}, 
  month =	 Oct, 
  key =		 {ICNP 1995}, 
  year =	 1995 
} 
@Proceedings{icnp96, 
  title =	 "Proceedings of the 4th International Conference on 
                  Network Protocols ({ICNP}) '96", 
  booktitle =	 "Proceedings of the 4th International Conference on 
                  Network Protocols ({ICNP}) '96", 
  address =	 {Columbus, OH}, 
  month =	 Oct, 
  year =	 1996, 
  key =		 {ICNP 1996}, 
  url = 
                  {\url{http://computer.org/proceedings/icnp/7453/7453toc.htm}} 
} 
@Proceedings{icnp97, 
  title =	 "Proceedings of the 5th International Conference on 
                  Network Protocols ({ICNP}) '97", 
  booktitle =	 "Proceedings of the 5th International Conference on 
                  Network Protocols ({ICNP}) '97", 
  address =	 {Atlanta, GA}, 
  month =	 Oct, 
  year =	 1997, 
  key =		 {ICNP 1997}, 
  url = 
                  {\url{http://computer.org/proceedings/icnp/8061/8061toc.htm}} 
} 
@Proceedings{icnp98, 
  title =	 "Proceedings of the 6th International Conference on 
                  Network Protocols ({ICNP}) '98", 
  booktitle =	 "Proceedings of the 6th International Conference on 
                  Network Protocols ({ICNP}) '98", 
  address =	 {Austin, TX}, 
  month =	 Oct, 
  year =	 1998, 
  key =		 {ICNP 1998}, 
  url = 
                  {\url{http://computer.org/proceedings/icnp/8988/8988toc.htm}} 
} 
@Proceedings{icnp99, 
  title =	 "Proceedings of the 7th International Conference on 
                  Network Protocols ({ICNP}) '99", 
  booktitle =	 "Proceedings of the 7th International Conference on 
                  Network Protocols ({ICNP}) '99", 
  address =	 {Toronto, Canada}, 
  month =	 Oct, 
  year =	 1999, 
  key =		 {ICNP 1999}, 
  url = 
                  {\url{http://computer.org/proceedings/icnp/0412/0412toc.htm}} 
} 
@Proceedings{imc01, 
  title =	 "Proceedings of {I}nternet Measurement Workshop 2001", 
  booktitle =	 {Proceedings of {I}nternet Measurement Workshop 2001}, 
  address =	 {San Francisco, CA}, 
  month =	 Nov, 
  key =		 {IMC 2001}, 
  year =	 2001, 
  url =		 {\url{http://www.icir.org/vern/imw-2001/}} 
} 
@Proceedings{imc02, 
  title =	 "Proceedings of {I}nternet Measurement Workshop", 
  booktitle =	 {Proceedings of {I}nternet Measurement Workshop}, 
  address =	 {Marseille, France}, 
  month =	 Nov, 
  key =		 {IMC 2002}, 
  url =		 {\url{http://www.icir.org/vern/imw-2002/}}, 
  year =	 2002 
} 
@Proceedings{imc03, 
  title =	 "Proceedings of the {I}nternet Measurement 
                  Conference", 
  booktitle =	 {Proceedings of the {I}nternet Measurement 
                  Conference}, 
  address =	 {Miami, FL}, 
  month =	 Oct, 
  key =		 {IMC 2003}, 
  url =		 {\url{http://www.icir.org/vern/imc-2003/}}, 
  year =	 2003 
} 
@Proceedings{imc04, 
  title =	 "Proceedings of the {I}nternet Measurement 
                  Conference", 
  booktitle =	 {Proceedings of the {I}nternet Measurement 
                  Conference}, 
  address =	 {}, 
  month =	 Oct, 
  key =		 {IMC 2004}, 
  year =	 2004 
} 
@Proceedings{dsn05, 
  title =	 "Proceedings of DSN '05", 
  booktitle =	 "Proceedings of DSN '05", 
  address =	 {Yokohama, Japan}, 
  month =	 {June}, 
  year =	 "2005", 
  key =		 {DSN 2000}, 
  url = 
                  {} 
} 
@Proceedings{infocom00, 
  title =	 "Proceedings of IEEE INFOCOM '00", 
  booktitle =	 "Proceedings of IEEE INFOCOM '00", 
  address =	 {Tel Aviv, Israel}, 
  month =	 Mar, 
  year =	 "2000", 
  key =		 {Infocom 2000}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=6725}} 
} 
@Proceedings{infocom01, 
  title =	 "Proceedings of IEEE INFOCOM '01", 
  booktitle =	 "Proceedings of IEEE INFOCOM '01", 
  address =	 {Anchorage, AK}, 
  month =	 Apr, 
  year =	 "2001", 
  key =		 {Infocom 2001}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=7321}} 
} 
@Proceedings{infocom02, 
  title =	 "Proceedings of IEEE INFOCOM '02", 
  booktitle =	 "Proceedings of IEEE INFOCOM '02", 
  address =	 {New York, NY}, 
  month =	 Jun, 
  year =	 "2002", 
  key =		 {Infocom 2002}, 
  url =		 {\url{http://www.ieee-infocom.org/2002/}} 
} 
@Proceedings{infocom03, 
  title =	 "Proceedings of IEEE INFOCOM '03", 
  booktitle =	 "Proceedings of IEEE INFOCOM '03", 
  address =	 {San Francisco, CA}, 
  month =	 Apr, 
  key =		 {Infocom 2003}, 
  year =	 "2003", 
  url =		 {\url{http://www.ieee-infocom.org/2003/}} 
} 
@Proceedings{infocom04, 
  title =	 "Proceedings of IEEE INFOCOM '04", 
  booktitle =	 "Proceedings of IEEE INFOCOM '04", 
  address =	 {Hong Kong, China}, 
  month =	 Apr, 
  key =		 {Infocom 2004}, 
  year =	 "2004", 
  url =		 {\url{http://www.ieee-infocom.org/2004/}} 
} 
@Proceedings{infocom05, 
  title =	 "Proceedings of IEEE INFOCOM '05", 
  booktitle =	 "Proceedings of IEEE INFOCOM '05", 
  address =	 {Miami, FL}, 
  month =	 Apr, 
  key =		 {Infocom 2005}, 
  year =	 "2005", 
  url =		 {\url{http://www.ieee-infocom.org/2005/}} 
} 
@Proceedings{infocom06, 
  title =	 "Proceedings of IEEE INFOCOM '06", 
  booktitle =	 "Proceedings of IEEE INFOCOM '06", 
  address =	 {Barcelona, Spain}, 
  month =	 Apr, 
  key =		 {Infocom 2006}, 
  year =	 "2006", 
  url =		 {\url{http://www.ieee-infocom.org/2006/}} 
} 
@Proceedings{infocom83, 
  title =	 "Proceedings of IEEE INFOCOM '83", 
  booktitle =	 "Proceedings of IEEE INFOCOM '83", 
  address =	 {San Diego, CA}, 
  month =	 May, 
  year =	 "1983", 
  key =		 {Infocom 1983}, 
  crossrefonly = 1 
} 
@Proceedings{infocom88, 
  title =	 "Proceedings of IEEE INFOCOM '88", 
  booktitle =	 "Proceedings of IEEE INFOCOM '88", 
  address =	 {}, 
  month =	 Mar, 
  year =	 "1988", 
  key =		 {Infocom 1988}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=192}}, 
  crossrefonly = 1 
} 
@Proceedings{infocom89, 
  title =	 "Proceedings of IEEE INFOCOM '89", 
  booktitle =	 "Proceedings of IEEE INFOCOM '89", 
  address =	 {}, 
  month =	 Apr, 
  year =	 "1989", 
  key =		 {Infocom 1989}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=238}}, 
  crossrefonly = 1 
} 
@Proceedings{infocom90, 
  title =	 "Proceedings of IEEE INFOCOM '90", 
  booktitle =	 "Proceedings of IEEE INFOCOM '90", 
  address =	 {}, 
  month =	 Jun, 
  year =	 "1990", 
  key =		 {Infocom 1990}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=291}}, 
  crossrefonly = 1 
} 
@Proceedings{infocom91, 
  title =	 "Proceedings of IEEE INFOCOM '91", 
  booktitle =	 "Proceedings of IEEE INFOCOM '91", 
  address =	 {}, 
  month =	 May, 
  year =	 "1991", 
  key =		 {Infocom 1991}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=535}}, 
  crossrefonly = 1 
} 
@Proceedings{infocom92, 
  title =	 "Proceedings of IEEE INFOCOM '92", 
  booktitle =	 "Proceedings of IEEE INFOCOM '92", 
  address =	 {}, 
  month =	 May, 
  year =	 "1992", 
  key =		 {Infocom 1992}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=643}}, 
  crossrefonly = 1 
} 
@Proceedings{infocom93, 
  title =	 "Proceedings of IEEE INFOCOM '93", 
  booktitle =	 "Proceedings of IEEE INFOCOM '93", 
  address =	 {}, 
  month =	 May, 
  key =		 {Infocom 1993}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=457}}, 
  year =	 "1993" 
} 
@Proceedings{infocom94, 
  title =	 "Proceedings of IEEE INFOCOM '94", 
  booktitle =	 "Proceedings of IEEE INFOCOM '94", 
  address =	 {}, 
  month =	 Jun, 
  key =		 {Infocom 1994}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=955}}, 
  year =	 "1994" 
} 
@Proceedings{infocom95, 
  title =	 "Proceedings of IEEE INFOCOM '95", 
  booktitle =	 "Proceedings of IEEE INFOCOM '95", 
  address =	 {}, 
  month =	 May, 
  year =	 "1995", 
  key =		 {Infocom 1995}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=3882}} 
} 
@Proceedings{infocom96, 
  title =	 "Proceedings of IEEE INFOCOM '96", 
  booktitle =	 "Proceedings of IEEE INFOCOM '96", 
  address =	 {}, 
  month =	 Apr, 
  year =	 "1996", 
  key =		 {Infocom 1996}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=3539}} 
} 
@Proceedings{infocom97, 
  title =	 "Proceedings of IEEE INFOCOM '97", 
  booktitle =	 "Proceedings of IEEE INFOCOM '97", 
  address =	 {Kobe, Japan}, 
  month =	 Apr, 
  year =	 "1997", 
  key =		 {Infocom 1997}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=4979}} 
} 
@Proceedings{infocom98, 
  title =	 "Proceedings of IEEE INFOCOM '98", 
  booktitle =	 "Proceedings of IEEE INFOCOM '98", 
  address =	 {San Francisco, CA}, 
  month =	 Mar, 
  year =	 "1998", 
  key =		 {Infocom 1998}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=5315}} 
} 
@Proceedings{infocom99, 
  title =	 "Proceedings of IEEE INFOCOM '99", 
  booktitle =	 "Proceedings of IEEE INFOCOM '99", 
  address =	 {New York, NY}, 
  month =	 Mar, 
  year =	 "1999", 
  key =		 {Infocom 1999}, 
  url = 
                  {\url{http://ieeexplore.ieee.org/lpdocs/epic03/RecentCon.htm?punumber=6063}} 
} 
@Proceedings{ipsn03, 
  title =	 {Proceedings of Second International Workshop on 
                  Information Processing in Sensor Networks ({IPSN'03})}, 
  booktitle =	 {Proceedings of Second International Workshop on 
                  Information Processing in Sensor Networks ({IPSN'03})}, 
  year =	 2003, 
  editor =	 {Feng Zhao and Leonidas Guibas}, 
  address =	 {Palo Alto, CA}, 
  month =	 Apr 
} 
@Proceedings{ipsn04, 
  title =	 {Proceedings of Third International Workshop on 
                  Information Processing in Sensor Networks ({IPSN'04})}, 
  booktitle =	 {Proceedings of Third International Workshop on 
                  Information Processing in Sensor Networks ({IPSN'04})}, 
  year =	 2004, 
  editor =	 {Feng Zhao and Leonidas Guibas}, 
  address =	 {Berkeley, CA}, 
  month =	 Apr 
} 
@Misc{locprivact01, 
  key =		 {Location Privacy Protection Act}, 
  title =	 {{Location Privacy Protection Act}}, 
  howpublished = 
                  {\url{http://www.techlawjournal.com/cong107/privacy/location/s1164is.asp}}, 
  year =	 2001 
} 
@Misc{lpsolve, 
  key =		 "lp\_solve", 
  title =	 {lp\_solve}, 
  howpublished = {ftp://ftp.ics.ele.tue.nl/pub/lp\_solve/} 
} 
@Proceedings{mobicom00, 
  title =	 "Proceedings of the Sixth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Sixth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  address =	 {Boston, MA}, 
  month =	 Aug, 
  year =	 2000, 
  key =		 {Mobicom 2000}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/345910/}} 
} 
@Proceedings{mobicom01, 
  title =	 "Proceedings of the Seventh International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Seventh International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  address =	 {Rome, Italy}, 
  month =	 Jul, 
  year =	 2001, 
  key =		 {Mobicom 2001}, 
  url = 
                  {\url{http://www.research.ibm.com/acm_sigmobile_conf_2001/}} 
} 
@Proceedings{mobicom02, 
  title =	 "Proceedings of the Eighth International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Eighth International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  url =		 {\url{http://www1.acm.org/sigs/sigmobile/mobicom/2002/}}, 
  address =	 {Atlanta, GA}, 
  month =	 Nov, 
  key =		 {Mobicom 2002}, 
  year =	 2002 
} 
@Proceedings{mobicom03, 
  title =	 "Proceedings of the Ninth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Ninth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  url =		 {\url{http://www1.acm.org/sigs/sigmobile/mobicom/2003/}}, 
  address =	 {San Diego, CA}, 
  month =	 Sep, 
  key =		 {Mobicom 2003}, 
  year =	 2003 
} 
@Proceedings{mobicom04, 
  title =	 "Proceedings of the Tenth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Tenth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  url =		 {\url{http://www1.acm.org/sigs/sigmobile/mobicom/2004/}}, 
  address =	 {}, 
  month =	 Sep, 
  key =		 {Mobicom 2004}, 
  year =	 2004 
} 
@Proceedings{mobicom05, 
  title =	 "Proceedings of the Eleventh International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Eleventh International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  url =		 {\url{http://www1.acm.org/sigs/sigmobile/mobicom/2005/}}, 
  address =	 {}, 
  month =	 Sep, 
  key =		 {Mobicom 2005}, 
  year =	 2005 
} 
@Proceedings{mobicom95, 
  title =	 "Proceedings of the First International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Procedings of the First International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  address =	 {Berkeley, CA}, 
  month =	 Nov, 
  year =	 "1995", 
  key =		 {Mobicom 1995}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/215530/}} 
} 
@Proceedings{mobicom96, 
  title =	 "Proceedings of the Second International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Second International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  address =	 {White Plains, NY}, 
  month =	 Nov, 
  year =	 1996, 
  key =		 {Mobicom 1996}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/236387/}} 
} 
@Proceedings{mobicom97, 
  title =	 "Proceedings of the Third International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Second International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  address =	 {Budapest Hungary}, 
  month =	 Sep, 
  year =	 1997, 
  key =		 {Mobicom 1997}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/262116/}} 
} 
@Proceedings{mobicom98, 
  title =	 "Proceedings of the Fourth International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Fourth International Conference 
                  on Mobile Computing and Networking ({Mobicom})", 
  address =	 {Dallas, TX}, 
  month =	 Oct, 
  year =	 1998, 
  key =		 {Mobicom 1998}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/288235/}} 
} 
@Proceedings{mobicom99, 
  title =	 "proceedings of the Fifth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  booktitle =	 "Proceedings of the Fifth International Conference on 
                  Mobile Computing and Networking ({Mobicom})", 
  address =	 {Seattle, WA}, 
  month =	 Nov, 
  year =	 1999, 
  key =		 {Mobicom 1999}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/313451/}} 
} 
@Proceedings{mobihoc00, 
  title =	 "Proceedings of the First ACM Workshop on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  booktitle =	 "Proceedings of the First ACM Workshop on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  address =	 {Boston, MA}, 
  month =	 Aug, 
  year =	 2000, 
  key =		 {MobiHoc 2000}, 
  url =		 {\url{http://www.acm.org/sigmobile/mobihoc/2000/}} 
} 
@Proceedings{mobihoc01, 
  title =	 "Proceedings of the Second ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  booktitle =	 "Proceedings of the Second ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  address =	 {Long Beach, CA}, 
  month =	 Oct, 
  year =	 2001, 
  key =		 {MobiHoc 2001}, 
  url =		 {\url{http://www.acm.org/sigmobile/mobihoc/2001/}} 
} 
@Proceedings{mobihoc02, 
  title =	 "Proceedings of the Third ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  booktitle =	 "Proceedings of the Third ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  address =	 {Lausanne, Switzerland}, 
  month =	 Jun, 
  year =	 2002, 
  key =		 {MobiHoc 2002}, 
  url =		 {\url{http://www.acm.org/sigmobile/mobihoc/2002/}} 
} 
@Proceedings{mobihoc03, 
  title =	 "Proceedings of the Fourth ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  booktitle =	 "Proceedings of the Fourth ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  address =	 {Annapolis, MD}, 
  month =	 {June 1-3}, 
  year =	 2003, 
  key =		 {MobiHoc 2003}, 
  url =		 {\url{http://www.acm.org/sigmobile/mobihoc/2003/}} 
} 
@Proceedings{mobihoc04, 
  title =	 "Proceedings of the Fifth ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  booktitle =	 "Proceedings of the Fifth ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  address =	 {Tokyo, Janpan}, 
  month =	 May, 
  year =	 2004, 
  key =		 {MobiHoc 2004}, 
  url =		 {\url{http://www.acm.org/sigmobile/mobihoc/2004/}} 
} 
@Proceedings{mobihoc05, 
  title =	 "Proceedings of the Sixth ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  booktitle =	 "Proceedings of the Sixth ACM Symposium on Mobile Ad 
                  Hoc Networking and Computing ({MobiHoc})", 
  address =	 {}, 
  month =	 Jun, 
  year =	 2005, 
  key =		 {MobiHoc 2005}, 
  url =		 {\url{http://www.acm.org/sigmobile/mobihoc/2005/}} 
} 
@Proceedings{mobisys03, 
  title =	 "Proceedings of the First International Conference on 
                  Mobile Systems, Applications, and Services 
                  ({MobiSys})", 
  booktitle =	 "Proceedings of the First International Conference on 
                  Mobile Systems, Applications, and Services 
                  ({MobiSys})", 
  address =	 {}, 
  month =	 Jun, 
  year =	 2003, 
  key =		 {MobiSys 2003}, 
  url =		 {\url{http://www.sigmobile.org/mobisys/2003/}} 
} 
@Proceedings{mobisys04, 
  title =	 "Proceedings of the Second International Conference 
                  on Mobile Systems, Applications, and Services 
                  ({MobiSys})", 
  booktitle =	 "Proceedings of the Second International Conference 
                  on Mobile Systems, Applications, and Services 
                  ({MobiSys})", 
  address =	 {Boston, MA}, 
  month =	 Jun, 
  year =	 2004, 
  key =		 {MobiSys 2004}, 
  url =		 {\url{http://www.sigmobile.org/mobisys/2004/}} 
} 
@Proceedings{mobisys05, 
  title =	 "Proceedings of the Third International Conference on 
                  Mobile Systems, Applications, and Services 
                  ({MobiSys})", 
  booktitle =	 "Proceedings of the Third International Conference on 
                  Mobile Systems, Applications, and Services 
                  ({MobiSys})", 
  address =	 {}, 
  month =	 Jun, 
  year =	 2005, 
  key =		 {MobiSys 2005}, 
  url =		 {\url{http://www.sigmobile.org/mobisys/2005/}} 
} 
@Proceedings{nossdav00, 
  title =	 "Proceedings of {NOSSDAV} '00", 
  booktitle =	 "Proceedings of {NOSSDAV} '00", 
  address =	 {Chapel Hill, NC}, 
  month =	 Jun, 
  year =	 2000, 
  key =		 {NOSSDAV 2000}, 
  url =		 {\url{http://www.nossdav.org/2000}} 
} 
@Proceedings{nossdav01, 
  title =	 "Proceedings of {NOSSDAV} '01", 
  booktitle =	 "Proceedings of {NOSSDAV} '01", 
  address =	 {Port Jefferson, NJ}, 
  month =	 Jun, 
  year =	 2001, 
  key =		 {NOSSDAV 2001}, 
  url =		 {\url{http://www.nossdav.org/2001}} 
} 
@Proceedings{nossdav95, 
  title =	 "Proceedings of {NOSSDAV} '95", 
  booktitle =	 "Proceedings of {NOSSDAV} '95", 
  address =	 {Durham, NH}, 
  month =	 Apr, 
  year =	 1995, 
  key =		 {NOSSDAV 1995}, 
  url =		 {\url{http://www.nossdav.org/1995}} 
} 
@Proceedings{nossdav96, 
  title =	 "Proceedings of {NOSSDAV} '96", 
  booktitle =	 "Proceedings of {NOSSDAV} '96", 
  address =	 {Zushi, Japan}, 
  month =	 Apr, 
  year =	 1996, 
  key =		 {NOSSDAV 1996}, 
  url =		 {\url{http://www.nossdav.org/1996}} 
} 
@Proceedings{nossdav97, 
  title =	 "Proceedings of {NOSSDAV} '97", 
  booktitle =	 "Proceedings of {NOSSDAV} '97", 
  address =	 {Basking Ridge, NJ}, 
  month =	 Apr, 
  year =	 1997, 
  key =		 {NOSSDAV 1997}, 
  url =		 {\url{http://www.nossdav.org/1997}} 
} 
@Proceedings{nossdav98, 
  title =	 "Proceedings of {NOSSDAV} '98", 
  booktitle =	 "Proceedings of {NOSSDAV} '98", 
  address =	 {Cambridge, UK}, 
  month =	 Jul, 
  year =	 1998, 
  key =		 {NOSSDAV 1998}, 
  url =		 {\url{http://www.nossdav.org/1998}} 
} 
@Proceedings{nossdav99, 
  title =	 "Proceedings of {NOSSDAV} '98", 
  booktitle =	 "Proceedings of {NOSSDAV} '98", 
  address =	 {Basking Ridge, N}, 
  month =	 Jun, 
  year =	 1999, 
  key =		 {NOSSDAV 1999}, 
  url =		 {\url{http://www.nossdav.org/1999}} 
} 
@Misc{ns-2, 
  key =		 "ns-2", 
  title =	 {The Network Simulator: ns-2}, 
  howpublished = {\url{http://www.isi.edu/nsnam/ns/}} 
} 
@Proceedings{nsdi03, 
  title =	 {Proceedings of {USENIX/ACM} Symposium on Networked 
                  Systems Design and Implementation ({NSDI '04})}, 
  booktitle =	 {Proceedings of {USENIX/ACM} Symposium on Networked 
                  Systems Design and Implementation ({NSDI '04})}, 
  address =	 {San Francisco, CA}, 
  month =	 Mar, 
  year =	 2004, 
  key =		 {NSDI 2004}, 
  url =		 {\url{http://www.usenix.org/events/nsdi04}} 
} 
@Proceedings{nsdi05, 
  title =	 {Proceedings of {USENIX/ACM} Symposium on Networked 
                  Systems Design and Implementation ({NSDI '05})}, 
  booktitle =	 {Proceedings of {USENIX/ACM} Symposium on Networked 
                  Systems Design and Implementation ({NSDI '05})}, 
  address =	 {San Francisco, CA}, 
  month =	 May, 
  year =	 2005, 
  key =		 {NSDI 2005}, 
  url =		 {\url{http://www.usenix.org/events/nsdi05}} 
} 
@Proceedings{nsdi07, 
  title =	 {Proceedings of {USENIX/ACM} Symposium on Networked 
                  Systems Design and Implementation ({NSDI '07})}, 
  booktitle =	 {Proceedings of {USENIX/ACM} Symposium on Networked 
                  Systems Design and Implementation ({NSDI '07})}, 
  address =	 {San Francisco, CA}, 
  month =	 May, 
  year =	 2007, 
  key =		 {NSDI 2007}, 
  url =		 {\url{http://www.usenix.org/events/nsdi05}} 
} 
@Proceedings{openarch98, 
  title =	 {Proceedings of IEEE OPENARCH '98}, 
  booktitle =	 {Proceedings of IEEE OPENARCH '98}, 
  address =	 {San Francisco, CA}, 
  month =	 Apr, 
  key =		 {Openarch 1998}, 
  year =	 1998 
} 
@Proceedings{osdi00, 
  title =	 {Proceedings of the 4th Symposium on Operating 
                  Systems Design and Implementation (OSDI) '00}, 
  booktitle =	 {Proceedings of the 4th Symposium on Operating 
                  Systems Design and Implementation (OSDI) '00}, 
  address =	 {San Diego, CA}, 
  month =	 Oct, 
  year =	 2000, 
  key =		 {OSDI 2000}, 
  url =		 {\url{http://www.usenix.org/events/osdi2000/}} 
} 
@Proceedings{osdi02, 
  title =	 {Proc. of {OSDI}}, 
  booktitle =	 {Proc. of {OSDI}}, 
  address =	 {Boston, MA}, 
  month =	 Dec, 
  year =	 2002, 
  key =		 {OSDI 2002}, 
  url =		 {\url{http://www.usenix.org/events/osdi02}} 
} 
@Proceedings{osdi04, 
  title =	 {Proceedings of the 6th Symposium on Operating 
                  Systems Design and Implementation (OSDI) '04}, 
  booktitle =	 {Proceedings of the 6th Symposium on Operating 
                  Systems Design and Implementation (OSDI) '04}, 
  address =	 {San Francisco, CA}, 
  month =	 Dec, 
  year =	 2004, 
  key =		 {OSDI 2004}, 
  url =		 {\url{http://www.usenix.org/events/osdi04}} 
} 
@Proceedings{osdi94, 
  title =	 {Proceedings of the 1st Symposium on Operating 
                  Systems Design and Implementation (OSDI) '94}, 
  booktitle =	 {Proceedings of the 1st Symposium on Operating 
                  Systems Design and Implementation (OSDI) '94}, 
  address =	 {Monterey, CA}, 
  month =	 Nov, 
  year =	 1994, 
  key =		 {OSDI 1994}, 
  url = 
                  {\url{http://www.usenix.org/publications/library/proceedings/osdi/index.html}} 
} 
@Proceedings{osdi96, 
  title =	 {Proceedings of the 2nd Symposium on Operating 
                  Systems Design and Implementation (OSDI) '96}, 
  booktitle =	 {Proceedings of the 2nd Symposium on Operating 
                  Systems Design and Implementation (OSDI) '96}, 
  address =	 {Seattle, WA}, 
  month =	 Oct, 
  year =	 1996, 
  key =		 {OSDI 1996}, 
  url = 
                  {\url{http://www.usenix.org/publications/library/proceedings/osdi96/index.html}} 
} 
@Proceedings{osdi99, 
  title =	 {Proceedings of the 3rd Symposium on Operating 
                  Systems Design and Implementation (OSDI) '99}, 
  booktitle =	 {Proceedings of the 3rd Symposium on Operating 
                  Systems Design and Implementation (OSDI) '99}, 
  address =	 {New Oreleans, LA}, 
  month =	 Feb, 
  year =	 1999, 
  key =		 {OSDI 1999}, 
  url = 
                  {\url{http://www.usenix.org/publications/library/proceedings/osdi99/}} 
} 
@Proceedings{pomc03, 
  title =	 "Proceedings of {DIALM-POMC} Joint Workshop on 
                  Foundations of Mobile Computing", 
  booktitle =	 "Proceedings of {DIALM-POMC} Joint Workshop on 
                  Foundations of Mobile Computing", 
  url =		 {\url{http://www.eas.asu.edu/dialm-pomc/}}, 
  address =	 {San Diego, CA}, 
  month =	 Sep, 
  key =		 {POMC 2003}, 
  year =	 2003 
} 
@Misc{roboinsect01, 
  key = {{BBC News}: Robotic insect takes to the air}, 
  title =	 {{BBC News}: Robotic insect takes to the air}, 
  howpublished = {\url{http://news.bbc.co.uk/1/hi/sci/tech/1270306.stm}}, 
  month =	 Apr, 
  year =	 2001 
} 
@Misc{roboinsect02, 
  key =		 {NASA Project: Planetary Exploration Using 
                  Biomimetics}, 
  title =	 {{NASA} Project: Planetary Exploration Using 
                  Biomimetics}, 
  howpublished = {\url{http://www.oai.org/pages/PlanX.html}}, 
} 
@Misc{roboinsect03, 
  key =		 {BBC News: Robot insect walks on water}, 
  title =	 {{BBC News}: Robot insect walks on water}, 
  howpublished = 
                  {\url{http://news.bbc.co.uk/2/hi/science/nature/3126299.stm}}, 
  month =	 {Aug}, 
  year =	 2003 
} 
@Misc{rocketfuel, 
  key =		 {N. Spring and R. Mahajan and D. Wetherall}, 
  author =	 {N. Spring and R. Mahajan and D. Wetherall}, 
  title =	 {{R}ocketfuel: An {ISP} Topology Mapping Engine}, 
  howpublished = {Available from 
                  \url{http://www.cs.washington.edu/research/networking/rocketfuel/}} 
} 
@Proceedings{sensys03, 
  title =	 "Proceedings of The First ACM Conference on Embedded 
                  Networked Sensor Systems ({SenSys})", 
  booktitle =	 "Proceedings of The First ACM Conference on Embedded 
                  Networked Sensor Systems ({SenSys})", 
  address =	 {Los Angles, CA}, 
  month =	 Nov, 
  year =	 2003, 
  key =		 {SenSys 2003}, 
  url =		 {\url{http://www.sigmobile.org/sensys/2003/}} 
} 
@Proceedings{sensys04, 
  title =	 "Proceedings of The Second ACM Conference on Embedded 
                  Networked Sensor Systems ({SenSys})", 
  booktitle =	 "Proceedings of The Second ACM Conference on Embedded 
                  Networked Sensor Systems ({SenSys})", 
  address =	 {Baltimore, Maryland}, 
  month =	 Nov, 
  year =	 2004, 
  key =		 {SenSys 2004}, 
  url =		 {\url{http://www.sigmobile.org/sensys/2004/}} 
} 
@Proceedings{sensys05, 
  title =	 "Proceedings of The Third ACM Conference on Embedded 
                  Networked Sensor Systems ({SenSys})", 
  booktitle =	 "Proceedings of The Third ACM Conference on Embedded 
                  Networked Sensor Systems ({SenSys})", 
  address =	 {}, 
  month =	 Nov, 
  year =	 2005, 
  key =		 {SenSys 2005}, 
  url =		 {\url{http://www.sigmobile.org/sensys/2005/}} 
} 
@Proceedings{sigcomm00, 
  title =	 "Proceedings of ACM SIGCOMM '00", 
  booktitle =	 "Proceedings of ACM SIGCOMM '00", 
  address =	 {Stockholm, Sweden}, 
  month =	 Aug, 
  year =	 "2000", 
  key =		 {SIGCOMM 2000}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/347059/}} 
} 
@Proceedings{sigcomm01, 
  title =	 "Proceedings of ACM SIGCOMM '01", 
  booktitle =	 "Proceedings of ACM SIGCOMM '01", 
  address =	 {San Diego, CA}, 
  month =	 Aug, 
  year =	 "2001", 
  key =		 {SIGCOMM 2001}, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2001/}} 
} 
@Proceedings{sigcomm02, 
  title =	 "Proc. of SIGCOMM", 
  booktitle =	 "Proc. of SIGCOMM", 
  address =	 {Pittsburgh, PA}, 
  month =	 Aug, 
  year =	 "2002", 
  key =		 {SIGCOMM 2002}, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2002/}} 
} 
@Proceedings{sigcomm03, 
  title =	 "Proc. of SIGCOMM", 
  booktitle =	 "Proc. of SIGCOMM", 
  address =	 {Karlsruhe, Germany}, 
  month =	 Aug, 
  year =	 "2003", 
  key =		 {SIGCOMM 2003}, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2003/}} 
} 
@Proceedings{podc02, 
  title =	 {Proceedings of the 21st {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  booktitle =	 {Proceedings of the 21st {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  year =	 2002, 
  address =	 {Monterey, CA}, 
  month =	 Jul 
} 
@Proceedings{podc03, 
  title =	 {Proceedings of the 22nd {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  booktitle =	 {Proceedings of the 22nd {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  year =	 2003, 
  address =	 {Boston, MA}, 
  month =	 Jul 
} 
@Proceedings{podc04, 
  title =	 {Proceedings of the 23rd {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  booktitle =	 {Proceedings of the 23rd {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  year =	 2004, 
  address =	 {St. John's, Newfoundland, Canada}, 
  month =	 Jul 
} 
@Proceedings{podc05, 
  title =	 {Proceedings of the 24th {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  booktitle =	 {Proceedings of the 24th {ACM} Symposium on 
                  Principles of Distributed Computing ({PODC})}, 
  year =	 2005, 
  address =	 {}, 
  month =	 Jul 
} 
@Proceedings{hotnets04, 
  title =	 {Proceedings of Third Workshop on Hot Topics in Networks 
                  ({HotNets-III})}, 
  booktitle =	 {Proceedings of Third Workshop on Hot Topics in Networks 
                  ({HotNets-III})}, 
  year =	 2004, 
  address =	 {San Diego, CA}, 
  month =	 Nov 
} 
@Proceedings{sigcomm04, 
  title =	 "Proc. of  SIGCOMM", 
  booktitle =	 "Proc. of  SIGCOMM", 
  address =	 {Portland, OR}, 
  month =	 Aug, 
  year =	 2004, 
  key =		 {SIGCOMM 2004}, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2004/}} 
} 
 
@Proceedings{sigcomm10, 
  title =	 "Proc. of  SIGCOMM", 
  booktitle =	 "Proc. of  SIGCOMM", 
  address =	 {Delhi, India}, 
  month =	 Aug, 
  year =	 2010, 
  key =		 {SIGCOMM 2010} 
} 
 
@Proceedings{pins04, 
  title =	 "Proceedings of ACM SIGCOMM '04 Workshop on Practice 
                  and Theory of Incentives and Game Theory in 
                  Networked Systems", 
  booktitle =	 "Proceedings of ACM SIGCOMM '04 Workshop on Practice and Theory 
                  of Incentives and Game Theory in Networked Systems", 
  address =	 {Portland, OR}, 
  month =	 Sep, 
  year =	 2004, 
  key =		 {SIGCOMM 2004}, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2004/}} 
} 
@Proceedings{fdna04, 
  title =	 "Proceedings of ACM SIGCOMM '04 Workshop on Future 
                  Directions in Network Architecture", 
  booktitle =	 "Proceedings of ACM SIGCOMM '04 Workshop on Future 
                  Directions in Network Architecture", 
  address =	 {Portland, OR}, 
  month =	 Sep, 
  year =	 2004, 
  key =		 {SIGCOMM 2004}, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2004/}} 
} 
@Proceedings{sigcomm05, 
  title =	 "Proc. of  SIGCOMM", 
  booktitle =	 "Proc. of  SIGCOMM", 
  address =	 {Philadelphia, PA}, 
  month =	 Aug, 
  year =	 "2005", 
  key =		 {SIGCOMM 2005}, 
  url =		 {\url{http://www.acm.org/sigs/sigcomm/sigcomm2005/}} 
} 
@Proceedings{sigcomm85, 
  title =	 "Proceedings of ACM SIGCOMM '85", 
  booktitle =	 "Proceedings of ACM SIGCOMM '85", 
  address =	 {British Columbia Canada}, 
  month =	 Aug, 
  year =	 "1985", 
  key =		 {SIGCOMM 1985}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/319056/}} 
} 
@Proceedings{sigcomm86, 
  title =	 "Proceedings of ACM SIGCOMM '86", 
  booktitle =	 "Proceedings of ACM SIGCOMM '86", 
  address =	 {Stowe, VT}, 
  month =	 Aug, 
  year =	 "1986", 
  key =		 {SIGCOMM 1986}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/18172/}} 
} 
@Proceedings{sigcomm87, 
  title =	 "Proceedings of ACM SIGCOMM '87", 
  booktitle =	 "Proceedings of ACM SIGCOMM '87", 
  address =	 {Stowe, VT}, 
  month =	 Aug, 
  year =	 "1988", 
  key =		 {SIGCOMM 1987}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/55482/}} 
} 
@Proceedings{sigcomm88, 
  title =	 "Proceedings of ACM SIGCOMM '88", 
  booktitle =	 "Proceedings of ACM SIGCOMM '88", 
  address =	 {Stanford, CA}, 
  month =	 Sep, 
  year =	 "1988", 
  key =		 {SIGCOMM 1988}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/52324/}} 
} 
@Proceedings{sigcomm89, 
  title =	 "Proceedings of ACM SIGCOMM '89", 
  booktitle =	 "Proceedings of ACM SIGCOMM '89", 
  address =	 {Austin, TX}, 
  month =	 Sep, 
  year =	 "1989", 
  key =		 {SIGCOMM 1989}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/75246/} 
}} 
@Proceedings{sigcomm90, 
  title =	 "Proceedings of ACM SIGCOMM '90", 
  booktitle =	 "Proceedings of ACM SIGCOMM '90", 
  address =	 {Philadelphia, PA}, 
  month =	 Sep, 
  year =	 "1990", 
  key =		 {SIGCOMM 1990}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/99508/}} 
} 
@Proceedings{sigcomm91, 
  title =	 "Proceedings of ACM SIGCOMM '91", 
  booktitle =	 "Proceedings of ACM SIGCOMM '91", 
  address =	 {Zurich, Switzerland}, 
  month =	 Sep, 
  year =	 "1991", 
  key =		 {SIGCOMM 1991}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/115992/}} 
} 
@Proceedings{sigcomm92, 
  title =	 "Proceedings of ACM SIGCOMM '92", 
  booktitle =	 "Proceedings of ACM SIGCOMM '92", 
  address =	 {Baltimore, MD}, 
  month =	 Aug, 
  year =	 "1992", 
  key =		 {SIGCOMM 1992}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/144179/}} 
} 
@Proceedings{sigcomm93, 
  title =	 "Proceedings of ACM SIGCOMM '93", 
  booktitle =	 "Proceedings of ACM SIGCOMM '93", 
  address =	 {San Francisco, CA}, 
  month =	 Sep, 
  year =	 "1993", 
  key =		 {SIGCOMM 1993}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/166237/}} 
} 
@Proceedings{sigcomm94, 
  title =	 "Proceedings of ACM SIGCOMM '94", 
  booktitle =	 "Proceedings of ACM SIGCOMM '94", 
  address =	 {London, England}, 
  month =	 Aug, 
  year =	 "1994", 
  key =		 {SIGCOMM 1994}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/190314/}} 
} 
@Proceedings{sigcomm95, 
  title =	 "Proceedings of ACM SIGCOMM '95", 
  booktitle =	 "Proceedings of ACM SIGCOMM '95", 
  address =	 {Cambridge, MA}, 
  month =	 Aug, 
  year =	 "1995", 
  key =		 {SIGCOMM 1995}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/217382/}} 
} 
@Proceedings{sigcomm96, 
  title =	 "Proceedings of ACM SIGCOMM '96", 
  booktitle =	 "Proceedings of ACM SIGCOMM '96", 
  address =	 {Stanford University, CA}, 
  month =	 Aug, 
  year =	 "1996", 
  key =		 {SIGCOMM 1996}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/248156/}} 
} 
@Proceedings{sigcomm97, 
  title =	 "Proceedings of ACM SIGCOMM '97", 
  booktitle =	 "Proceedings of ACM SIGCOMM '97", 
  address =	 {Cannes, France}, 
  month =	 Sep, 
  year =	 "1997", 
  key =		 {SIGCOMM 1997}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/263105/}} 
} 
@Proceedings{sigcomm98, 
  title =	 "Proceedings of ACM SIGCOMM '98", 
  booktitle =	 "Proceedings of ACM SIGCOMM '98", 
  address =	 {Vancouver, B.C.}, 
  month =	 Sep, 
  year =	 "1998", 
  key =		 {SIGCOMM 1998}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/285237/}} 
} 
@Proceedings{sigcomm99, 
  title =	 "Proceedings of ACM SIGCOMM '99", 
  booktitle =	 "Proceedings of ACM SIGCOMM '99", 
  address =	 {Cambridge, MA}, 
  month =	 Aug, 
  year =	 "1999", 
  key =		 {SIGCOMM 1999}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/comm/316188/}} 
} 
@Proceedings{sigmetrics00, 
  title =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  booktitle =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  address =	 {Santa Clara, CA}, 
  month =	 Jun, 
  year =	 2000, 
  key =		 {SIGMETRICS 2000}, 
  url =		 {\url{http://www-net.cs.umass.edu/sigmetrics2000/}} 
} 
@Proceedings{sigmetrics01, 
  title =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  booktitle =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  address =	 {Cambridge, MA}, 
  month =	 Jun, 
  year =	 2001, 
  key =		 {SIGMETRICS 2001}, 
  url =		 {\url{http://www.cs.umd.edu/conference/sigmetrics2001/}} 
} 
@Proceedings{sigmetrics02, 
  title =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  booktitle =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  address =	 {Riverside, CA}, 
  month =	 Jun, 
  year =	 2002, 
  key =		 {SIGMETRICS 2002}, 
  url =		 {} 
} 
@Proceedings{sigmetrics03, 
  title =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  booktitle =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  address =	 {San Diego, CA}, 
  month =	 Jun, 
  year =	 2003, 
  key =		 {SIGMETRICS 2003}, 
  url =		 {} 
} 
@Article{TAR05, 
  author =	 {Renata Teixeira and Sharad Agarwal and Jennifer 
                  Rexford}, 
  journal =	 {{ACM} {SIGCOMM} Computer Communications Review}, 
  title =	 {{BGP} routing changes: Merging views from two 
                  {ISPs}}, 
  year =	 2005, 
  month =	 Oct 
} 
@Proceedings{sigmetrics04, 
  title =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  booktitle =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  address =	 {New York, NY}, 
  month =	 Jun, 
  year =	 2004, 
  key =		 {SIGMETRICS 2004}, 
  url =		 {} 
} 
@Proceedings{sigmetrics05, 
  title =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  booktitle =	 "Proceedings of Joint International Conference on Measurement and 
                  Modeling of Computer Systems (SIGMETRICS)", 
  address =	 {}, 
  month =	 Jun, 
  year =	 2005, 
  key =		 {SIGMETRICS 2005}, 
  url =		 {} 
} 
@Proceedings{sigmetrics98, 
  title =	 "Proceedings of ACM International Conference on 
                  Measurement and Modeling of Computer Systems 
                  (SIGMETRICS)", 
  booktitle =	 "Proceedings of ACM International Conference on 
                  Measurement and Modeling of Computer Systems 
                  (SIGMETRICS)", 
  address =	 {Madison, WI}, 
  month =	 Jun, 
  year =	 1998, 
  key =		 {SIGMETRICS 1998}, 
  url = 
                  {\url{http://dblp.uni-trier.de/db/conf/sigmetrics/sigmetrics98.html}} 
} 
@Proceedings{sigmetrics99, 
  title =	 "Proceedings of ACM International Conference on 
                  Measurement and Modeling of Computer Systems 
                  (SIGMETRICS)", 
  booktitle =	 "Proceedings of ACM International Conference on 
                  Measurement and Modeling of Computer Systems 
                  (SIGMETRICS)", 
  address =	 {Atlanta, GA}, 
  month =	 Jun, 
  year =	 1999, 
  key =		 {SIGMETRICS 1999}, 
  url =		 {\url{http://www.cs.usask.ca/faculty/carey/sigmetrics99/}} 
} 
@Proceedings{soda02, 
  title =	 {Proceedings of the Thirteenth Annual {ACM-SIAM} 
                  Symposium on Discrete Algorithms}, 
  booktitle =	 {Proceedings of the Thirteenth Annual {ACM-SIAM} 
                  Symposium on Discrete Algorithms}, 
  year =	 2002, 
  address =	 {San Francisco, CA}, 
  month =	 Jan 
} 
@Proceedings{sosp01, 
  title =	 {Proceedings of the 18th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 18th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Banff, Canada}, 
  month =	 Oct, 
  year =	 2001, 
  key =		 {SOSP 2001}, 
  url =		 {\url{http://www-cse.ucsd.edu/sosp01/}} 
} 
@Proceedings{sosp03, 
  title =	 {Proceedings of the 19th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 19th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Bolton Landing }, 
  month =	 Oct, 
  year =	 2003, 
  key =		 {SOSP 2003}, 
  url =		 {} 
} 
@Proceedings{sosp05, 
  title =	 {Proceedings of the 20th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 20th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {}, 
  month =	 Oct, 
  year =	 2005, 
  key =		 {SOSP 2005}, 
  url =		 {} 
} 
@Proceedings{sosp83, 
  title =	 {Proceedings of the 9th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 9th Annual ACM Symposium on 
                  Operating Systems principles}, 
  address =	 {}, 
  month =	 Jun, 
  key =		 {SOSP 1983}, 
  year =	 1983 
} 
@Proceedings{sosp85, 
  title =	 {Proceedings of the 10th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 10th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {}, 
  month =	 Jun, 
  key =		 {SOSP 1985}, 
  year =	 1985 
} 
@Proceedings{sosp87, 
  title =	 {Proceedings of the 11th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 11th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Austin, TX}, 
  month =	 Nov, 
  year =	 1987, 
  key =		 {SOSP 1987}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/ops/41457/}} 
} 
@Proceedings{sosp89, 
  title =	 {Proceedings of the 12th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 12th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Litchfield Pk., AZ}, 
  month =	 Dec, 
  year =	 1989, 
  key =		 {SOSP 1989}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/ops/74850/}} 
} 
@Proceedings{sosp91, 
  title =	 {Proceedings of the 13th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 13th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Pacific Grove, CA}, 
  month =	 Dec, 
  year =	 1991, 
  key =		 {SOSP 1991}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/ops/121132/}} 
} 
@Proceedings{sosp93, 
  title =	 {Proceedings of the 14th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 14th annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Asheville, USA}, 
  month =	 Oct, 
  year =	 1993, 
  key =		 {SOSP 1993}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/ops/168619/`}} 
} 
@Proceedings{sosp95, 
  title =	 {Proceedings of the 15th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 15th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Copper Mountain, CO}, 
  month =	 Dec, 
  year =	 1995, 
  key =		 {SOSP 1995}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/ops/224056/}} 
} 
@Proceedings{sosp97, 
  title =	 {Proceedings of the 16th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 16th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Malo, France}, 
  month =	 Oct, 
  year =	 1997, 
  key =		 {SOSP 1997}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/ops/268998/}} 
} 
@Proceedings{sosp99, 
  title =	 {Proceedings of the 17th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  booktitle =	 {Proceedings of the 17th Annual ACM Symposium on 
                  Operating Systems Principles}, 
  address =	 {Charleston United States}, 
  month =	 Dec, 
  year =	 1999, 
  key =		 {SOSP 1999}, 
  url = 
                  {\url{http://www.acm.org/pubs/contents/proceedings/ops/319151/}} 
} 
@Proceedings{stoc00, 
  title =	 {Proceedings of the 32nd Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 32nd Annual Symposium on Theory 
                  of Computing}, 
  year =	 2000, 
  key =		 {STOC 2000}, 
  url =		 {} 
} 
@Proceedings{stoc01, 
  title =	 {Proceedings of the 33rd Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 33rd Annual Symposium on Theory 
                  of Computing}, 
  year =	 2001, 
  key =		 {STOC 2001}, 
  url =		 {} 
} 
@Proceedings{stoc02, 
  title =	 {Proceedings of the 34th Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 34th Annual Symposium on Theory 
                  of Computing}, 
  year =	 2002, 
  key =		 {STOC 2002}, 
  url =		 {} 
} 
@Proceedings{stoc03, 
  title =	 {Proceedings of the 35th Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 35th Annual Symposium on Theory 
                  of Computing}, 
  year =	 2003, 
  key =		 {STOC 2003}, 
  url =		 {} 
} 
@Proceedings{stoc04, 
  title =	 {Proceedings of the 36th Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 36th Annual Symposium on Theory 
                  of Computing}, 
  year =	 2004, 
  month =        Jun, 
  address = {Chicago, IL}, 
  key =		 {STOC 2004}, 
  url =		 {} 
} 
@Proceedings{stoc05, 
  title =	 {Proceedings of the 37th Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 37th Annual Symposium on Theory 
                  of Computing}, 
  year =	 2005, 
  key =		 {STOC 2005}, 
  url =		 {} 
} 
@Proceedings{stoc69, 
  title =	 {Proceedings of the Annual Symposium on Theory of 
                  Computing 1969}, 
  booktitle =	 {Proceedings of the Annual Symposium on Theory of 
                  Computing 1969}, 
  year =	 1969, 
  key =		 {STOC 1969}, 
  url =		 {} 
} 
@Proceedings{stoc95, 
  title =	 {Proceedings of the 27th Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 27th Annual Symposium on Theory 
                  of Computing}, 
  year =	 1995, 
  key =		 {STOC 1995}, 
  url =		 {} 
} 
@Proceedings{stoc97, 
  title =	 {Proceedings of the 29th Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 29th Annual Symposium on Theory 
                  of Computing}, 
  year =	 1997, 
  key =		 {STOC 1997}, 
  url = 
                  {} 
} 
@Proceedings{stoc98, 
  title =	 {Proceedings of the 30th Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 30th Annual Symposium on Theory 
                  of Computing}, 
  year =	 1998, 
  key =		 {STOC 1998}, 
  url = 
                  {} 
} 
@Proceedings{stoc99, 
  title =	 {Proceedings of the 31st Annual Symposium on Theory 
                  of Computing}, 
  booktitle =	 {Proceedings of the 31st Annual Symposium on Theory 
                  of Computing}, 
  year =	 1999, 
  key =		 {STOC 1999}, 
  url = 
                  {} 
} 
@Misc{telenav, 
  key =		 {Telenav}, 
  title =	 {Telenav}, 
  howpublished = {\url{http://www.telenav.com}}, 
  year =	 2004 
} 
@Proceedings{usits99, 
  title =	 {Proceedings of the USENIX Symposium on Internet 
                  Technologies and Systems ({USITS})}, 
  booktitle =	 {Proceedings of the USENIX Symposium on Internet 
                  Technologies and Systems ({USITS})}, 
  month =	 Oct, 
  year =	 1999, 
  key =		 {USITS 1999}, 
  url =		 {} 
} 
@Proceedings{wcnc03, 
  title =	 "Proceedings of {IEEE} Wireless Communications and 
                  Networking Conference ({WCNC})", 
  booktitle =	 "Proceedings of {IEEE} Wireless Communications and 
                  Networking Conference ({WCNC})", 
  address =	 {New Orlean, LA}, 
  month =	 Mar, 
  key =		 {WCNC 2003}, 
  year =	 2003 
} 
@misc{internapSLA, 
  author =	 {Internap}, 
  title =	 {Service Level Agreement}, 
  note =	 {\url{http://www.internap.com/product/technology/performanceip/files/SLA%20Data%20Sheet%20FINAL%200505.pdf.pdf}} 
} 
@Article{JD03, 
  author =	 {M. Jain and C. Dovrolis}, 
  title =	 {End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with {TCP} Throughput}, 
  journal =	 ton , 
  volume =	 {11} , 
  number =	 {4} , 
  year =	 2003 , 
} 
@inproceedings{iplane, 
  title =	 "{iPlane}: An Information Plane for Distributed 
                  Services", 
  author =	 "H. V. Madhyastha and T. Isdal and M. Piatek and 
                  C. Dixon and T. Anderson and A. Krishnamurthy and 
                  A. Venkataramani", 
  booktitle =	 "Proc. of {OSDI}", 
  address = {Seattle, WA}, 
  year =	 2006 
} 
@InProceedings{bittyrant, 
  author =	 {M. Piatek and T. Isdal and T. Anderson and A. Krishnamurthy and A. Venkataramani}, 
  title =	 {{Do Incentives Build Robustness in BitTorrent?}}, 
  booktitle = {Proc. of {NSDI}}, 
  year = 2007 
} 
@inproceedings{karagiannis05should, 
  author = "T. Karagiannis and P. Rodriguez and K. Papagiannaki", 
  title = {{Should {I}nternet Service Providers Fear Peer-Assisted Content Distribution}}, 
  booktitle = {{Proc. of IMC}}, 
  year = "2005" 
} 
@inproceedings{cons-hash, 
  author =	 "David Karger and Eric Lehman and Tom Leighton and 
                  Mathhew Levine and Daniel Lewin and Rina Panigrahy", 
  title =	 "Consistent Hashing and Random Trees: Distributed 
                  Caching Protocols for Relieving Hot Spots on the 
                  World Wide Web", 
  booktitle =	 "{ACM} {STOC}", 
  year =	 "1997" 
} 
@inproceedings{hafeeda, 
    title = {{Modeling and Caching of Peer-to-Peer Traffic}}, 
    author = {{Mohamed Hefeeda and Osama Saleh}}, 
    booktitle = {{Proc. of ICNP}}, 
    year = 2006 
} 
@article{GV00, 
  author =	 {Garth A. Gibson and Rodney Van Meter}, 
  title =	 {Network attached storage architecture}, 
  journal =	 {Commun. ACM}, 
  volume =	 43, 
  number =	 11, 
  year =	 2000, 
  issn =	 {0001-0782}, 
  pages =	 {37--45}, 
  doi =		 {http://doi.acm.org/10.1145/353360.353362}, 
  publisher =	 {ACM}, 
  address =	 {New York, NY, USA}, 
} 
@InProceedings{HN08, 
  author =	 {Mohamed Hefeeda and Behrooz Noorizadeh}, 
  title =	 {Cooperative caching: The case for {P2P} traffic}, 
  booktitle =	 {Proc. of {LCN}}, 
  year =	 2008 
} 
@TechReport{BLMZ04, 
  author =	 {Micah Beck and Huadong Liu and Terry Moore and Yong 
                  Zheng}, 
  title =	 {Pipelining and Caching the {I}nternet {B}ackplane 
                  {P}rotocol}, 
  institution =	 {University of Tennessee}, 
  year =	 2004, 
  number =	 {UT-CS-04-529} 
} 
@Article{BBM+03, 
  author =	 {Alessandro Bassi and Micah Beck and Terry Moore and 
                  James S. Plank and Martin Swany and Rich Wolski and 
                  Graham Fagg}, 
  title =	 {The {I}nternet {B}ackplane {P}rotocol: A Study in Resource 
                  Sharing}, 
  journal =	 {Future Generation Computing Systems}, 
  year =	 2003 
} 
@inproceedings{YA05, 
    title = {{GPS}: A General Peer-to-Peer Simulator and its Use for Modeling BitTorrent}, 
    author = {Weishuai Yang and Nael Abu-Ghazaleh}, 
    booktitle = {{Proc. of MASCOTS}}, 
    year = 2005 
} 
@misc{nlanr:amp, 
key = {Active Measurement Project}, 
title = {{Active Measurement Project}}, 
howpublished = {\url{http://watt.nlanr.net/Status}} 
} 
@misc{dcia, 
    key = {DCIA}, 
    title = {{Distributed Computing Industry Association}}, 
    howpublished = {\url{http://www.dcia.info}}, 
} 
@misc{planetlab, 
    key = {PlanetLab}, 
    title = {{PlanetLab}}, 
    howpublished = {\url{http://www.planet-lab.org}}, 
} 
@misc{peerapp, 
    key = {PeerApp}, 
    title = {{PeerApp}}, 
    howpublished = {\url{http://www.peerapp.com/products-ultraband-How-Caching-Works.aspx}}, 
} 
@misc{oversi, 
    key = {Oversi}, 
    title = {{Oversi}}, 
    howpublished = {\url{http://www.oversi.com/index.php?option=com_content&task=view&id=48&Itemid=103}}, 
} 
@misc{joost, 
    key = {joost}, 
    title = {{Joost}}, 
    howpublished = {\url{http://www.joost.org/whatsjoost.html}} 
} 
@misc{ppstream, 
    key = {ppstream}, 
    title = {{PPStream}}, 
    howpublished = {\url{http://www.ppstream.com/}} 
} 
@misc{limewire, 
    key = {limewire}, 
    title = {{Limewire}}, 
    howpublished = {\url{http://www.limewire.com/}} 
} 
@misc{bittorrent, 
    key = {bittorrent}, 
    title = {{BitTorrent}}, 
    howpublished = {\url{http://www.bittorrent.com/}} 
} 
@misc{vuze, 
    key = {Vuze}, 
    title = {{Vuze}}, 
    howpublished = {\url{http://www.vuze.com/}} 
} 
@misc{maxmind, 
    key = {Maxmind}, 
    title = {{MaxMind}}, 
    howpublished = {\url{http://www.maxmind.com/}} 
} 
@misc{emule, 
    key = {eMule}, 
    title = {{eMule}}, 
    howpublished = {\url{http://www.emule.com/}} 
} 
@misc{xunlei, 
    key = {xunlei}, 
    title = {{Xunlei}}, 
    howpublished = {\url{http://www.xunlei.com/}} 
} 
@misc{flashget, 
    key = {flashget}, 
    title = {{Flashget}}, 
    howpublished = {\url{http://www.flashget.com/}} 
} 
@misc{pplive, 
    key = {pplive}, 
    title = {{pplive}}, 
    howpublished = {\url{http://www.pplive.com/}} 
} 
@misc{uusee, 
    key = {uusee}, 
    title = {{UUSee}}, 
    howpublished = {\url{http://www.uusee.com/}} 
} 
@misc{sopcast, 
    key = {sopcast}, 
    title = {{SopCast}}, 
    howpublished = {\url{http://www.sopcast.com/}}, 
} 
@misc{tvants, 
    key = {tvants}, 
    title = {{TVAnts}}, 
    howpublished = {\url{http://www.tvants.com/}}, 
} 
@misc{abacast, 
    key = {abacst}, 
    title = {{Abacast}}, 
    howpublished = {\url{http://www.abacast.com/}} 
} 
@misc{zatoo, 
    key = {Zatoo}, 
    title = {{Zatoo}}, 
    howpublished = {\url{http://www.zatoo.com/}} 
} 
@misc{ledbat, 
    key = {LEDBAT}, 
    title = {{IETF LEDBAT Working Group}}, 
    howpublished = {\url{http://www.ietf.org/html.charters/ledbat-charter.html}} 
} 
@misc{alto, 
    key = {ALTO}, 
    title = {{IETF ALTO Working Group}}, 
    howpublished = {\url{http://www.ietf.org/html.charters/alto-charter.html}} 
} 
@misc{p2pi, 
    key = {IETF P2Pi}, 
    title = {{IETF P2Pi Workshop}}, 
    howpublished = {\url{http://www.ietf.org/internet-drafts/draft-p2pi-cooper-workshop-report-00.txt}}, 
    year = 2008 
} 
@misc{coralcdn, 
    key = {CoralCDN}, 
    title = {{CoralCDN}}, 
    howpublished = {\url{http://www.coralcdn.org/}} 
} 
@misc{kontiki, 
    key = {kontiki}, 
    title = {{Kontiki}}, 
    howpublished = {\url{http://www.kontiki.com}}, 
} 
@misc{pando, 
    key = {pando}, 
    title = {{Pando Networks, Inc.}}, 
    howpublished = {\url{http://www.pandonetworks.com}}, 
} 
@InProceedings{XYK+08, 
  author =	 {Haiyong Xie and Yang Richard Yang and Arvind 
                  Krishnamurthy and Yanbin Liu and Avi Silberschatz}, 
  title =	 {{P4P}: Provider Portal for Applications}, 
  booktitle =	 {Proc. of SIGCOMM}, 
  year =	 2008 
} 
@InProceedings{WZ07, 
  title =	 {Proportional response dynamics leads to market 
                  equilibrium}, 
  author =	 {F. Wu and L. Zhang}, 
  booktitle =	 {Proc. of STOC}, 
  year =	 2008 
} 
@InProceedings{LLSB08, 
  title =	 {BitTorrent is an Auction}, 
  author =	 {Dave Levin and Katrina LaCurts and Neil Spring and 
                  Bobby Bhattacharjee}, 
  booktitle =	 {Proc. of SIGCOMM}, 
  year =	 2008 
} 
@InProceedings{AGA+08, 
  author =	 { A. Anand and A. Gupta and A. Akella and S. Seshan and 
                  S. Shenker}, 
  title =	 {Packet caches on routers: The implications of 
                  universal redundant traffic elimination}, 
  booktitle =	 {Proc. of SIGCOMM}, 
  year =	 2008 
} 
@InProceedings{CB08, 
  author =	 {David R. Choffnes and Fabian E. Bustamante}, 
  title =	 {Taming the Torrent: A practical approach to reducing 
                  cross-{ISP} traffic in {P2P} systems}, 
  booktitle =	 {Proc. of SIGCOMM}, 
  year =	 2008 
} 
@InProceedings{GQXYZ04, 
    author =	 {David Goldenberg and Lili Qiu and Haiyong Xie and Yang Richard Yang and Yin Zhang}, 
    title =	 {Optimizing Cost and Performance for Internet Multihoming}, 
    booktitle =	 {Proceedings of {ACM SIGCOMM} '04}, 
    year =	 2004, 
    address =	 {Portland, OR}, 
    month =	 Aug, 
} 
@TechReport{PDKA06, 
  author =	 {Michael Piatek and Colin Dixon and Arvind Krishnamurthy and Tom Anderson}, 
  title =	 {LiveSwarms: Adapting BitTorrent for end host multicast}, 
  number =       {UW-CSE-06-11-01}, 
institution =  {University of Washington},  
  year =	 2006, 
  url =		 {\url{http://www.cs.washington.edu/homes/ckd/liveswarms.pdf}} 
} 
@InProceedings{YDT06, 
    author =     {Mao Yang and Yafei Dai and Jing Tian}, 
    title =      {Analyzing Peer-to-Peer Traffic's Impact on Large Scale Networks}, 
    booktitle =  {Proceedings of International Conference on Computational Science '06}, 
    year =       2006, 
    address =    {}, 
    month =      {}, 
} 
@Article{AFS07, 
    author =       {Vinay Aggarwal and Anja Feldmann and Christian Scheideler},  
    title =        {Can {ISPs} and {P2P} systems cooperate for improved performance?}, 
    journal =      {{ACM} {CCR}}, 
    year =         2007, 
    month =        {July}, 
    url = {http://dx.doi.org/10.1145/1273445.1273449}, 
} 
 
@inproceedings{tdlte,
 author = {Kerttula, Jussi and Malm, Nicolas and Ruttik, Kalle and J\"{a}ntti, Riku and Tirkkonen, Olav},
 title = {Implementing {TD-LTE} As Software Defined Radio in General Purpose Processor},
 booktitle = {ACM SRIF},
 year = {2014}
}

@Article{Ziria,
 author       = {Gordon Stewart and Mahanth Gowda and Geoffrey Mainland and Bozidar Radunovic and Dimitrios Vytiniotis},
 number       = {MSR-TR-2013-135},
 title        = {Ziria: Wireless Programming for Hardware Dummies},
 year         = {2013},
}

@inproceedings{feldspar,
 author = {Emil Axelsson and Koen Claessen and Gergely Devai and Zoltan Horvath and Karin Keijzer and Bo Lyckegard and Anders Persson and Mary Sheeran and Josef Svenningsson and Andras Vajda},
 title = {Feldspar: A Domain Specific Language for Digital Signal Processing algorithms},
 booktitle = {IEEE/ACM MEMOCODE},
 year = {2010}
}
@inproceedings{oai,
 title = {OpenAirInterface System},
 booktitle = {www.openairinterface.org},
}
